Work

An Adaptive Cell Method for Delaunay Triangulation

Year: 1992
Type: article
Abstract: We present two new fast algorithms for constructing the Delaunay triangulation of a set of N points in the plane.The first algorithm is based on a uniform cell approach; it runs in O(N log N) expected time when the points are uniformly distributed and O(N2) otherwise.The second algorithm is an adaptive cell method which runs in O(N log N) time even when the points are drawn from a highly nonuniform distribution.Both algorithms extend immediately to three-dimensional Delaunay tessellation.We also describe numerical experiments which show both methods to be highly efficient when N is larger than a hundred.The adaptive method is slightly slower than the uniform on uniformly distributed points but hundreds of times faster when N is large_and the points are nonuniformly distributed.It is O(N log N) in either case, while the uniform method degenerates to O(N2) for nonuniformly distributed points.
Author: John Strain
Language: English
Open Access status: green
OpenAlex ID: W2781885027
FWCI:
Cites: 29
Cited by:
Related to: 10