3,981 research outputs found
Design and optimization of fuel injection of a 50 kW micro turbogas
The present article deals with the design of a micro turbogas turbine suitable for on board applications, e.g., as a power generator on hybrid transit bus, characterized by a simple constructive approach. Deriving the machine layout from an existing KJ-66 aircraft model engine, the authors propose a theoretical design of a compact, lightweight turbogas turbine, by investigating the technical possibility and limits of the proposed design. In particular, a different combustion chamber layout has been proposed, and fuel adduction channels for different swirler designs have been simulated via ANSYS Fluent in order to identify a satisfactory fuel spreading. As a result, the complete characterization of the design parameters and geometries has been performed, and a series of RANS simulations has been used in order to identify an optimal swirler configuration
Average Interpolation Under the Maximum Angle Condition
Interpolation error estimates needed in common finite element applications
using simplicial meshes typically impose restrictions on the both the
smoothness of the interpolated functions and the shape of the simplices. While
the simplest theory can be generalized to admit less smooth functions (e.g.,
functions in H^1(\Omega) rather than H^2(\Omega)) and more general shapes
(e.g., the maximum angle condition rather than the minimum angle condition),
existing theory does not allow these extensions to be performed simultaneously.
By localizing over a well-shaped auxiliary spatial partition, error estimates
are established under minimal function smoothness and mesh regularity. This
construction is especially important in two cases: L^p(\Omega) estimates for
data in W^{1,p}(\Omega) hold for meshes without any restrictions on simplex
shape, and W^{1,p}(\Omega) estimates for data in W^{2,p}(\Omega) hold under a
generalization of the maximum angle condition which previously required p>2 for
standard Lagrange interpolation
VoroCrust: Voronoi Meshing Without Clipping
Polyhedral meshes are increasingly becoming an attractive option with
particular advantages over traditional meshes for certain applications. What
has been missing is a robust polyhedral meshing algorithm that can handle broad
classes of domains exhibiting arbitrarily curved boundaries and sharp features.
In addition, the power of primal-dual mesh pairs, exemplified by
Voronoi-Delaunay meshes, has been recognized as an important ingredient in
numerous formulations. The VoroCrust algorithm is the first provably-correct
algorithm for conforming polyhedral Voronoi meshing for non-convex and
non-manifold domains with guarantees on the quality of both surface and volume
elements. A robust refinement process estimates a suitable sizing field that
enables the careful placement of Voronoi seeds across the surface circumventing
the need for clipping and avoiding its many drawbacks. The algorithm has the
flexibility of filling the interior by either structured or random samples,
while preserving all sharp features in the output mesh. We demonstrate the
capabilities of the algorithm on a variety of models and compare against
state-of-the-art polyhedral meshing methods based on clipped Voronoi cells
establishing the clear advantage of VoroCrust output.Comment: 18 pages (including appendix), 18 figures. Version without compressed
images available on https://www.dropbox.com/s/qc6sot1gaujundy/VoroCrust.pdf.
Supplemental materials available on
https://www.dropbox.com/s/6p72h1e2ivw6kj3/VoroCrust_supplemental_materials.pd
SurfelMeshing: Online Surfel-Based Mesh Reconstruction
We address the problem of mesh reconstruction from live RGB-D video, assuming
a calibrated camera and poses provided externally (e.g., by a SLAM system). In
contrast to most existing approaches, we do not fuse depth measurements in a
volume but in a dense surfel cloud. We asynchronously (re)triangulate the
smoothed surfels to reconstruct a surface mesh. This novel approach enables to
maintain a dense surface representation of the scene during SLAM which can
quickly adapt to loop closures. This is possible by deforming the surfel cloud
and asynchronously remeshing the surface where necessary. The surfel-based
representation also naturally supports strongly varying scan resolution. In
particular, it reconstructs colors at the input camera's resolution. Moreover,
in contrast to many volumetric approaches, ours can reconstruct thin objects
since objects do not need to enclose a volume. We demonstrate our approach in a
number of experiments, showing that it produces reconstructions that are
competitive with the state-of-the-art, and we discuss its advantages and
limitations. The algorithm (excluding loop closure functionality) is available
as open source at https://github.com/puzzlepaint/surfelmeshing .Comment: Version accepted to IEEE Transactions on Pattern Analysis and Machine
Intelligenc
Unstructured mesh algorithms for aerodynamic calculations
The use of unstructured mesh techniques for solving complex aerodynamic flows is discussed. The principle advantages of unstructured mesh strategies, as they relate to complex geometries, adaptive meshing capabilities, and parallel processing are emphasized. The various aspects required for the efficient and accurate solution of aerodynamic flows are addressed. These include mesh generation, mesh adaptivity, solution algorithms, convergence acceleration, and turbulence modeling. Computations of viscous turbulent two-dimensional flows and inviscid three-dimensional flows about complex configurations are demonstrated. Remaining obstacles and directions for future research are also outlined
Design and development of auxiliary components for a new two-stroke, stratified-charge, lean-burn gasoline engine
A unique stepped-piston engine was developed by a group of research engineers at Universiti Teknologi Malaysia (UTM), from 2003 to 2005. The development work undertaken by them engulfs design, prototyping and evaluation over a predetermined period of time which was iterative and challenging in nature. The main objective of the program is to demonstrate local R&D capabilities on small engine work that is able to produce mobile powerhouse of comparable output, having low-fuel consumption and acceptable emission than its crankcase counterpart of similar displacement. A two-stroke engine work was selected as it posses a number of technological challenges, increase in its thermal efficiency, which upon successful undertakings will be useful in assisting the group in future powertrain undertakings in UTM. In its carbureted version, the single-cylinder aircooled engine incorporates a three-port transfer system and a dedicated crankcase breather. These features will enable the prototype to have high induction efficiency and to behave very much a two-stroke engine but equipped with a four-stroke crankcase lubrication system. After a series of analytical work the engine was subjected to a series of laboratory trials. It was also tested on a small watercraft platform with promising indication of its flexibility of use as a prime mover in mobile platform. In an effort to further enhance its technology features, the researchers have also embarked on the development of an add-on auxiliary system. The system comprises of an engine control unit (ECU), a directinjector unit, a dedicated lubricant dispenser unit and an embedded common rail fuel unit. This support system was incorporated onto the engine to demonstrate the finer points of environmental-friendly and fuel economy features. The outcome of this complete package is described in the report, covering the methodology and the final characteristics of the mobile power plant
Lattice cleaving: a multimaterial tetrahedral meshing algorithm with guarantees
pre-printWe introduce a new algorithm for generating tetrahedral meshes that conform to physical boundaries in volumetric domains consisting of multiple materials. The proposed method allows for an arbitrary number of materials, produces high-quality tetrahedral meshes with upper and lower bounds on dihedral angles, and guarantees geometric fidelity. Moreover, the method is combinatoric so its implementation enables rapid mesh construction. These meshes are structured in a way that also allows grading, to reduce element counts in regions of homogeneity. Additionally, we provide proofs showing that both element quality and geometric fidelity are bounded using this approach
Recommended from our members
Optimisation of Novel Elliptically-Based Web Opening Shapes of Perforated Steel Beams
A new study was carried out and presented herein, on the optimisation of novel elliptically-based web opening shapes which enhance the structural behaviour of the perforated beams as well as lead to economic design in terms of both manufacture and usage. The finite element (FE) model used in the study was validated against experimental work conducted by the authors and the results of the comprehensive study are presented in this research paper. For ease of comparison, the yield patterns and deflected shapes of the perforated beams are presented at three characteristic load level points. Finally, shear-moment interaction FEM curves are presented for six different web opening shapes to allow for easy use of the empirical design formulas that have previously been proposed by the authors in a complementary research paper. An overall study of many standard and non-standard web opening shapes, it was shown that perforated beams with vertical and inclined classic elliptical web openings (3:4 width to depth ratio) behave more effectively compared to perforated beams with conventional circular and hexagonal web openings, mainly in terms of stress distribution and local deflection. Therefore, perforated steel beams with large novel elliptically-based web openings with short critical opening length at the top and bottom tee-section as well as straight-line edges are presented for first time and examined in the current research programme
Locally optimal Delaunay-refinement and optimisation-based mesh generation
The field of mesh generation concerns the development of efficient algorithmic techniques to construct high-quality tessellations of complex geometrical objects. In this thesis, I investigate the problem of unstructured simplicial mesh generation for problems in two- and three-dimensional spaces, in which meshes consist of collections of triangular and tetrahedral elements. I focus on the development of efficient algorithms and computer programs to produce high-quality meshes for planar, surface and volumetric objects of arbitrary complexity. I develop and implement a number of new algorithms for mesh construction based on the Frontal-Delaunay paradigm - a hybridisation of conventional Delaunay-refinement and advancing-front techniques. I show that the proposed algorithms are a significant improvement on existing approaches, typically outperforming the Delaunay-refinement technique in terms of both element shape- and size-quality, while offering significantly improved theoretical robustness compared to advancing-front techniques. I verify experimentally that the proposed methods achieve the same element shape- and size-guarantees that are typically associated with conventional Delaunay-refinement techniques. In addition to mesh construction, methods for mesh improvement are also investigated. I develop and implement a family of techniques designed to improve the element shape quality of existing simplicial meshes, using a combination of optimisation-based vertex smoothing, local topological transformation and vertex insertion techniques. These operations are interleaved according to a new priority-based schedule, and I show that the resulting algorithms are competitive with existing state-of-the-art approaches in terms of mesh quality, while offering significant improvements in computational efficiency. Optimised C++ implementations for the proposed mesh generation and mesh optimisation algorithms are provided in the JIGSAW and JITTERBUG software libraries
- …