Constrained delaunay triangulations
Data up to Jan 2025
Total Citations Per Year
Abstract
References (10)
Computational Geometry
1985 • 3,403 citations
Two algorithms for constructing a Delaunay triangulation
1980 • 1,425 citations
A sweepline algorithm for Voronoi diagrams
1987 • 1,121 citations
AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments
1987 • 301 citations
Generalized delaunay triangulation for planar graphs
1986 • 273 citations
Efficient computation of continuous skeletons
1979 • 256 citations
There is a planar graph almost as good as the complete graph
1986 • 241 citations
Voronoi diagrams based on convex distance functions
1985 • 225 citations
Proximity and reachability in the plane.
1978 • 134 citations
Delaunay-based representation of surfaces defined over arbitrarily shaped domains
1985 • 122 citations