Delaunay meshing of piecewise smooth complexes without expensive predicates (Q1662514): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q1314530 |
||
Property / author | |||
Property / author: Tamal Krishna Dey / rank | |||
Revision as of 17:04, 27 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Delaunay meshing of piecewise smooth complexes without expensive predicates |
scientific article |
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