A POINT-PLACEMENT STRATEGY FOR CONFORMING DELAUNAY TETRAHEDRALIZATION
- 1 December 2001
- journal article
- Published by World Scientific Pub Co Pte Ltd in International Journal of Computational Geometry & Applications
- Vol. 11 (6), 669-682
- https://doi.org/10.1142/s0218195901000699
Abstract
A strategy is presented to find a set of points that yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear complex (PLC). This algorithm is novel because it imposes no angle restrictions on the input PLC. In the process, an algorithm is described that computes a planar conforming Delaunay triangulation of a Planar Straight-Line Graph (PSLG) such that each triangle has a bounded circumradius, which may be of independent interest.Keywords
This publication has 4 references indexed in Scilit:
- Centroidal Voronoi Tessellations: Applications and AlgorithmsSiam Review, 1999
- A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh GenerationJournal of Algorithms, 1995
- An upper bound for conforming Delaunay triangulationsDiscrete & Computational Geometry, 1993
- Constrained delaunay triangulationsAlgorithmica, 1989