Sciweavers

Share
DCG
2008

General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties

9 years 9 months ago
General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domains, they have "nicely shaped" triangles that optimize several criteria, and they are easy to construct and update. The present work generalizes constrained Delaunay triangulations (CDTs) to higher dimensions and describes constrained variants of regular triangulations, here christened weighted CDTs and constrained regular triangulations. CDTs and weighted CDTs are powerful and practical models of geometric domains, especially in two and three dimensions. The main contributions are rigorous, theory-tested definitions of constrained Delaunay triangulations and piecewise linear complexes (geometric domains that incorporate nonconvex faces with "internal" boundaries), a characterization of the combinatorial properties of CDTs and weighted CDTs (including a generalization of the Delaunay Lemma)...
Jonathan Richard Shewchuk
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2008
Where DCG
Authors Jonathan Richard Shewchuk
Comments (0)
books