809 research outputs found
Paving the path towards automatic hexahedral mesh generation
Esta tesis versa sobre el desarrollo de las tecnologÃas para la generación de mallas de hexaedros. El proceso de generar una malla de hexaedros no es automático y su generación requiere varias horas te trabajo de un ingeniero especializado. Por lo tanto, es importante desarrollar herramientas que faciliten dicho proceso de generación. Con este fin, se presenta y desarrolla un método de proyección de mallas, una técnica de sweeping o barrido, un algoritmo para la obtención de mallas por bloques, y un entorno de generación de mallas. Las implementaciones más competitivas del método de sweeping utilizan técnicas de proyección de mallas basadas en métodos afines. Los métodos afines más habituales presentan varios problemas relacionados con la obtención de sistemas de ecuaciones normales de rango deficiente. Para solucionar dichos problemas se presenta y analiza un nuevo método afÃn que depende de dos parámetros vectoriales. Además, se detalla un procedimiento automático para la selección de dichos vectores. El método de proyección resultante preserva la forma de las mallas proyectadas. Esta proyección es incorporada también en una nueva herramienta de sweeping. Dicha herramienta genera capas de nodos internos que respetan la curvatura de las superficies inicial y final. La herramienta de sweeping es capaz de mallar geometrÃas de extrusión definidas por trayectorias curvas, secciones no constantes a lo largo del eje de sweeping, y superficies inicial y final con diferente forma y curvatura.En las últimas décadas se han propuesto varios ataques para la generación automática de mallas de hexahedros. Sin embargo, todavÃa no existe un algoritmo rápido y robusto que genere automáticamente mallas de hexaedros de alta calidad. Se propone un nuevo ataque para la generación de mallas por bloques mediante la representación de la geometrÃa y la topologÃa del dual de una malla de hexaedros. En dicho ataque, primero se genera una malla grosera de tetraedros. Después, varió polÃgonos planos se añaden al interior de los elementos de la malla grosera inicial. Dichos polÃgonos se denotan como contribuciones duales locales y representan una versión discreta del dual de una malla de hexaedros. En el último paso, la malla por bloques se obtiene como el dual de la representación del dual generada. El algoritmo de generación de mallas por bloques es aplicado a geometrÃas que presentan diferentes caracterÃsticas geométricas como son superficies planas, superficies curvas, configuraciones delgadas, agujeros, y vértices con valencia mayor que tres.Las mallas se generan habitualmente con la ayuda de entornos interactivos que integran una interfaz CAD y varios algoritmos de generación de mallas. Se presenta un nuevo entorno de generación de mallas especializado en la generación de cuadriláteros y hexaedros. Este entorno proporciona la tecnologÃa necesaria para implementar les técnicas de generación de mallas de hexaedros presentadas en esta tesis.This thesis deals with the development of hexahedral mesh generation technology. The process of generating hexahedral meshes is not fully automatic and it is a time consuming task. Therefore, it is important to develop tools that facilitate the generation of hexahedral meshes. To this end, a mesh projection method, a sweeping technique, a block-meshing algorithm, and an interactive mesh generation environment are presented and developed. Competitive implementations of the sweeping method use mesh projection techniques based on affine methods. Standard affine methods have several drawbacks related to the statement of rank deficient sets of normal equations. To overcome these drawbacks a new affine method that depends on two vector parameters is presented and analyzed. Moreover, an automatic procedure that selects these two vector parameters is detailed. The resulting projection procedure preserves the shape of projected meshes. Then, this procedure is incorporated in a new sweeping tool. This tool generates inner layers of nodes that preserve the curvature of the cap surfaces. The sweeping tool is able to mesh extrusion geometries defined by non-linear sweeping trajectories, non-constant cross sections along the sweep axis, non-parallel cap surfaces, and cap surfaces with different shape and curvature. In the last decades, several general-purpose approaches to generate automatically hexahedral meshes have been proposed. However, a fast and robust algorithm that automatically generates high-quality hexahedral meshes is not available. A novel approach for block meshing by representing the geometry and the topology of a hexahedral mesh is presented. The block-meshing algorithm first generates an initial coarse mesh of tetrahedral elements. Second, several planar polygons are added inside the elements of the initial coarse mesh. These polygons are referred as local dual contributions and represent a discrete version of the dual of a hexahedral mesh. Finally, the dual representation is dualized to obtain the final block mesh. The block-meshing algorithm is applied to mesh geometries that present different geometrical characteristics such as planar surfaces, curved surfaces, thin configurations, holes, and vertices with valence greater than three.Meshes are usually generated with the help of interactive environments that integrate a CAD interface and several meshing algorithms. An overview of a new mesh generation environment focused in quadrilateral and hexahedral mesh generation is presented. This environment provides the technology required to implement the hexahedral meshing techniques presented in this thesis.Postprint (published version
Unstructured and semi-structured hexahedral mesh generation methods
Discretization techniques such as the finite element method, the finite volume method or the discontinuous Galerkin method are the most used simulation techniques in ap- plied sciences and technology. These methods rely on a spatial discretization adapted to the geometry and to the prescribed distribution of element size. Several fast and robust algorithms have been developed to generate triangular and tetrahedral meshes. In these methods local connectivity modifications are a crucial step. Nevertheless, in hexahedral meshes the connectivity modifications propagate through the mesh. In this sense, hexahedral meshes are more constrained and therefore, more difficult to gener- ate. However, in many applications such as boundary layers in computational fluid dy- namics or composite material in structural analysis hexahedral meshes are preferred. In this work we present a survey of developed methods for generating structured and unstructured hexahedral meshes.Peer ReviewedPostprint (published version
Quad Meshing
Triangle meshes have been nearly ubiquitous in computer graphics, and a large body of data structures and geometry processing algorithms based on them has been developed in the literature. At the same time, quadrilateral meshes, especially semi-regular ones, have advantages for many applications, and significant progress was made in quadrilateral mesh generation and processing during the last several years. In this State of the Art Report, we discuss the advantages and problems of techniques operating on quadrilateral meshes, including surface analysis and mesh quality, simplification, adaptive refinement, alignment with features, parametrization, and remeshing
Constructing IGA-suitable planar parameterization from complex CAD boundary by domain partition and global/local optimization
In this paper, we propose a general framework for constructing IGA-suitable
planar B-spline parameterizations from given complex CAD boundaries consisting
of a set of B-spline curves. Instead of forming the computational domain by a
simple boundary, planar domains with high genus and more complex boundary
curves are considered. Firstly, some pre-processing operations including
B\'ezier extraction and subdivision are performed on each boundary curve in
order to generate a high-quality planar parameterization; then a robust planar
domain partition framework is proposed to construct high-quality patch-meshing
results with few singularities from the discrete boundary formed by connecting
the end points of the resulting boundary segments. After the topology
information generation of quadrilateral decomposition, the optimal placement of
interior B\'ezier curves corresponding to the interior edges of the
quadrangulation is constructed by a global optimization method to achieve a
patch-partition with high quality. Finally, after the imposition of
C1=G1-continuity constraints on the interface of neighboring B\'ezier patches
with respect to each quad in the quadrangulation, the high-quality B\'ezier
patch parameterization is obtained by a C1-constrained local optimization
method to achieve uniform and orthogonal iso-parametric structures while
keeping the continuity conditions between patches. The efficiency and
robustness of the proposed method are demonstrated by several examples which
are compared to results obtained by the skeleton-based parameterization
approach
Geometry and Structural Modeling for High-Fidelity Aircraft Conceptual Design Optimization
Peer Reviewedhttps://deepblue.lib.umich.edu/bitstream/2027.42/140431/1/6.2014-2041.pd
On curving high-order hexahedral meshes
We present a new definition of distortion and quality measures for high-order hexahedral (quadrilateral) elements. This definition leads to two direct applications. First, it can be used to check the validity and quality of a high-order hexahedral (quadrilateral) mesh. Second, it allows the generation of high-order curved meshes composed of valid and high-quality hexahedral (quadrilateral) elements. We describe a method to simultaneously smooth and untangle high-order hexahedral (quadrilateral) meshes by minimizing the proposed mesh distortion. Finally, we analyze the behavior of the proposed distortion measure and we present several results to illustrate the benefits of the mesh generation framework.Peer ReviewedPostprint (author's final draft
Generation of curved high-order meshes with optimal quality and geometric accuracy
We present a novel methodology to generate curved high-order meshes featuring optimal mesh quality and geometric accuracy. The proposed technique combines a distortion measure and a geometric L2-disparity measure into a single objective function. While the element distortion term takes into account the mesh quality, the L2-disparity term takes into account the geometric error introduced by the mesh approximation to the target geometry. The proposed technique has several advantages. First, we are not restricted to interpolative meshes and therefore, the resulting mesh approximates the target domain in a non-interpolative way, further increasing the geometric accuracy. Second, we are able to generate a series of meshes that converge to the actual geometry with expected rate while obtaining high-quality elements. Third, we show that the proposed technique is robust enough to handle real-case geometries that contain gaps between adjacent entities.Peer ReviewedPostprint (published version
Generation of Curved High-order Meshes with Optimal Quality and Geometric Accuracy
We present a novel methodology to generate curved high-order meshes featuring optimal mesh quality and geometric accuracy. The proposed technique combines a distortion measure and a geometric Full-size image (<1 K)-disparity measure into a single objective function. While the element distortion term takes into account the mesh quality, the Full-size image (<1 K)-disparity term takes into account the geometric error introduced by the mesh approximation to the target geometry. The proposed technique has several advantages. First, we are not restricted to interpolative meshes and therefore, the resulting mesh approximates the target domain in a non-interpolative way, further increasing the geometric accuracy. Second, we are able to generate a series of meshes that converge to the actual geometry with expected rate while obtaining high-quality elements. Third, we show that the proposed technique is robust enough to handle real-case geometries that contain gaps between adjacent entities.This research was partially supported by the Spanish Ministerio de EconomÃa y Competitividad under grand contract
CTM2014-55014-C3-3-R, and by the Government of Catalonia under grand contract 2014-SGR-1471. The work of the last author was supported by the European Commission through the Marie Sklodowska-Curie Actions
(HiPerMeGaFlows project).Peer ReviewedPostprint (published version
- …