Delaunay meshing of piecewise smooth complexes without expensive predicates (Q1662514)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Delaunay meshing of piecewise smooth complexes without expensive predicates |
scientific article; zbMATH DE number 6920481
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Delaunay meshing of piecewise smooth complexes without expensive predicates |
scientific article; zbMATH DE number 6920481 |
Statements
Delaunay meshing of piecewise smooth complexes without expensive predicates (English)
0 references
20 August 2018
0 references
Summary: 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.
0 references
Delaunay refinement
0 references
mesh generation
0 references
piecewise-smooth complexes
0 references
non-smoothness
0 references
non-manifoldness
0 references
