skip to main content

This content will become publicly available on August 22, 2017

Title: All-quad meshing without cleanup

Here, we present an all-quad meshing algorithm for general domains. We start with a strongly balanced quadtree. In contrast to snapping the quadtree corners onto the geometric domain boundaries, we move them away from the geometry. Then we intersect the moved grid with the geometry. The resulting polygons are converted into quads with midpoint subdivision. Moving away avoids creating any flat angles, either at a quadtree corner or at a geometry–quadtree intersection. We are able to handle two-sided domains, and more complex topologies than prior methods. The algorithm is provably correct and robust in practice. It is cleanup-free, meaning we have angle and edge length bounds without the use of any pillowing, swapping, or smoothing. Thus, our simple algorithm is fast and predictable. This paper has better quality bounds, and the algorithm is demonstrated over more complex domains, than our prior version.
ORCiD logo [1] ;  [2] ;  [3] ;  [4] ;  [2]
  1. Univ. of Texas, Austin, TX (United States); Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
  2. Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
  3. Univ. of California, Davis, CA (United States)
  4. Univ. of Texas, Austin, TX (United States)
Publication Date:
OSTI Identifier:
Report Number(s):
Journal ID: ISSN 0010-4485; PII: S001044851630080X; TRN: US1700163
Grant/Contract Number:
Accepted Manuscript
Journal Name:
Computer Aided Design
Additional Journal Information:
Journal Name: Computer Aided Design; Journal ID: ISSN 0010-4485
Research Org:
Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
Sponsoring Org:
USDOE National Nuclear Security Administration (NNSA)
Country of Publication:
United States
97 MATHEMATICS AND COMPUTING; all-quadrilateral meshing; guaranteed quality; sharp features