Q-TRAN: A New Approach to Transform Triangular Meshes into Quadrilateral Meshes Locally

Ebeida, Mohamed S.; Karamete, Kaan; Mestreau, Eric; Dey, Saikat

doi:10.1007/978-3-642-15414-0_2

Cited by 7 publications

(6 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In this sense, they can also be classified as outside-inside methods. Reference [61] proposes a local method based on edge classification to transform triangular surface meshes into quadrilateral ones. On the contrary, in reference [62] a graph-based method to to combine triangles into quadrilateral elements using the Blossom algorithm.…”

Section: Indirect Methodsmentioning

confidence: 99%

Unstructured and Semi-Structured Hexahedral Mesh Generation Methods

Ramos¹,

Ruiz‐Gironés²,

Navarro³

2014

Comp. Tech. Rev.

View full text Add to dashboard Cite

Discretization techniques such the finite element method, the finite volume method or the discontinuous Galerkin method are the most used simulation techniques in applied 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 generate. However, in many applications such as boundary layers in computational fluid dynamics 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.

show abstract

Section: Indirect Methodsmentioning

confidence: 99%

Unstructured and Semi-Structured Hexahedral Mesh Generation Methods

Ramos¹,

Ruiz‐Gironés²,

Navarro³

2014

Comp. Tech. Rev.

View full text Add to dashboard Cite

show abstract

“…However, Q-Morph requires topological cleanup and smoothing to guarantee the quality of the final all-quad mesh. Q-Tran [14] is another indirect algorithm that produces quadrilaterals with provably-good quality without a smoothing post-processing step, and manages to handle domain boundaries. Nevertheless, the class of indirect methods typically suffers from a large number of irregular nodes that are connected to more (or less) than four mesh elements, which is typically undesired in several numerical simulations.…”

Section: Introductionmentioning

confidence: 99%

All-Hex Meshing of Multiple-Region Domains without Cleanup

Awad

Rushdi

Abbas

et al. 2016

Procedia Engineering

Self Cite

View full text Add to dashboard Cite

In this paper, we present a new algorithm for all-hex meshing of domains with multiple regions without post-processing cleanup. Our method starts with a strongly balanced octree. In contrast to snapping the grid points onto the geometric boundaries, we move points a slight distance away from the common boundaries. Then we intersect the moved grid with the geometry. This allows us to avoid creating any flat angles, and we are able to handle two-sided regions and more complex topologies than prior methods. The algorithm is robust and cleanup-free; without the use of any pillowing, swapping, or smoothing. Thus, our simple algorithm is also more predictable than prior art.

show abstract

“…However, Q-Morph requires topological cleanup and smoothing to guarantee the quality of the final all-quad mesh. Q-Tran [15] is another indirect algorithm that produces quadrilaterals with provably-good quality without a smoothing post-processing step, and manages to handle domain boundaries. Nevertheless, the class of indirect methods typically suffers from a large number of irregular nodes that are connected to more (or less) than four mesh elements, which is typically undesired in several numerical simulations.…”

Section: Introductionmentioning

confidence: 99%

Robust All-quad Meshing of Domains with Connected Regions

Rushdi

Mitchell

Bajaj

et al. 2015

Procedia Engineering

Self Cite

View full text Add to dashboard Cite

In this paper, we present a new algorithm for all-quad meshing of non-convex domains, with connected regions. Our method starts with a strongly balanced quadtree. In contrast to snapping the grid points onto the geometric boundaries, we move points a slight distance away from the common boundaries. Then we intersect the moved grid with the geometry. This allows us to avoid creating any flat quads, and we are able to handle two-sided regions and more complex topologies than prior methods. The algorithm is provably correct, robust, and cleanup-free; meaning we have angle and edge length bounds, without the use of any pillowing, swapping, or smoothing. Thus, our simple algorithm is also more predictable than prior art.

show abstract

Q-TRAN: A New Approach to Transform Triangular Meshes into Quadrilateral Meshes Locally

Cited by 7 publications

References 21 publications

Unstructured and Semi-Structured Hexahedral Mesh Generation Methods

Unstructured and Semi-Structured Hexahedral Mesh Generation Methods

All-Hex Meshing of Multiple-Region Domains without Cleanup

Robust All-quad Meshing of Domains with Connected Regions

Contact Info

Product

Resources

About