Delaunay Meshing of Piecewise Smooth Complexes without Expensive Predicates

Tamal K. Dey, Joshua A. Levine
Algorithms 2(4)
November, 2009

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.

[DOI/EE link]

@article{DL09,
  author    = {Tamal K. Dey and Joshua A. Levine},
  ee        = {http://dx.doi.org/10.3390/a2041327},
  journal   = {Algorithms},
  month     = {11},
  number    = {4},
  pages     = {1327--1349},
  publisher = {MDPI},
  title     = {{D}elaunay Meshing of Piecewise Smooth Complexes without Expensive
Predicates},
  volume    = {2},
  year      = {2009}
}