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

  • Authors:

  • Jonathan Richard Shewchuk

  • Affiliations:

  • University of California at Berkeley, Department of Electrical Engineering and Computer Sciences, 94720, Berkeley, CA, USA

  • Venue:
  • Discrete & Computational Geometry
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 CDTs 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), the proof of several optimality properties of CDTs when they are used for piecewise linear interpolation, and a simple and useful condition that guarantees that a domain has a CDT. These results provide foundations for reasoning about CDTs and proving the correctness of algorithms. Later articles in this series discuss algorithms for constructing and updating CDTs.