Updating and constructing constrained delaunay and constrained regular triangulations by flips

I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CDTs, also known as constrained regular triangulations. The facet insertion algorithm is likely to outperform other known algorithms on most inputs. The facet deletion algorithm is the first proposed for d > 2, short of recomputing the CDT from scratch. An incremental facet insertion algorithm that begins with an unconstrained Delaunay triangulation can construct the CDT of a ridge-protected piecewise linear complex with nv vertices in O(n d/2 +1 v log nv) time. Hence, in odd dimensions, CDT construction by incremental facet insertion is within a factor of log nv of worst-case optimal. Perhaps the most important feature of these algorithms is that they are relatively easy to implement. Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Probl...

• Type: Conference
• Year: 2003
• Where: COMPGEOM
• Authors: Jonathan Richard Shewchuk
• Keywords: Algorithms, COMPGEOM 2003, Facet Insertion, Facet Insertion Algorithm