Abstract
Recently a Delaunay refinement algorithm has been proposed that can mesh piecewise smooth complexes which include polyhedra, smooth and piecewise smooth surfaces, and non-manifolds. However, this algorithm employs domain dependent numerical predicates, some of which could be computationally expensive and hard to implement. In this paper we develop a refinement strategy that eliminates these complicated domain dependent predicates. As a result we obtain a meshing algorithm that is practical and implementation-friendly.
Original language | English (US) |
---|---|
Pages (from-to) | 1327-1349 |
Number of pages | 23 |
Journal | Algorithms |
Volume | 2 |
Issue number | 4 |
DOIs | |
State | Published - Dec 2009 |
Externally published | Yes |
Keywords
- Delaunay refinement
- Mesh generation
- Non-manifoldness
- Non-smoothness
- Piecewise-smooth complexes
ASJC Scopus subject areas
- Theoretical Computer Science
- Numerical Analysis
- Computational Theory and Mathematics
- Computational Mathematics