Excitable Delaunay triangulations

Restricted Constrained Delaunay Triangulations

We introduce the restricted constrained Delaunay triangulation (restricted CDT). The restricted CDT generalizes the restricted Delaunay triangulation, allowing us to define a triangulation of a surface that includes a set of constraining segments. Under certain sampling conditions, the restricted CDT includes every constrained segment and suggests an algorithm that produces a triangulation of t...

Blocking Delaunay triangulations

Given a set B of n black points in general position, we say that a set of white points W blocks B if in the Delaunay triangulation of [Formula: see text] there is no edge connecting two black points. We give the following bounds for the size of the smallest set W blocking B: (i) [Formula: see text] white points are always sufficient to block a set of n black points, (ii) if B is in convex posit...

Higher Order Delaunay Triangulations

Linear-Time Delaunay Triangulations Simplified∗

Recently it was shown that — under reasonable assumptions — Voronoi diagrams and Delaunay triangulations of planar point sets can be computed in time o(n log n), beating the classical comparisonbased lower bound. A number of increasingly faster randomized algorithms have been proposed, most recently a linear-time algorithm based on a randomized incremental construction that uses a combination o...

Voronoi Diagrams and Delaunay Triangulations

The Voronoi diagram of a set of sites partitions space into regions one per site the region for a site s consists of all points closer to s than to any other site The dual of the Voronoi diagram the Delaunay triangulation is the unique triangulation so that the circumsphere of every triangle contains no sites in its interior Voronoi diagrams and Delaunay triangulations have been rediscovered or...