A faster divide-and-conquer algorithm for constructing delaunay triangulations

  title={A faster divide-and-conquer algorithm for constructing delaunay triangulations},
  author={Rex A. Dwyer},
  • R. Dwyer
  • Published 1 November 1987
  • Computer Science
  • Algorithmica
An easily implemented modification to the divide-and-conquer algorithm for computing the Delaunay triangulation ofn sites in the plane is presented. The change reduces its Θ(n logn) expected running time toO(n log logn) for a large class of distributions that includes the uniform distribution in the unit square. Experimental evidence presented demonstrates that the modified algorithm performs very well forn≤216, the range of the experiments. It is conjectured that the average number of edges it… 
An efficient sweep-line Delaunay triangulation algorithm
Localizing the Delaunay Triangulation and its Parallel Implementation
  • Renjie Chen, C. Gotsman
  • Computer Science
    2012 Ninth International Symposium on Voronoi Diagrams in Science and Engineering
  • 2012
We show how to localize the Delaunay triangulation of a given planar point set, namely, bound the set of points which are possible Delaunay neighbors of a given point. We then exploit this
An efficient algorithm for constructing Delaunay triangulation
An algorithm for fast constructing Delaunay triangulations was proposed, which optimize triangles based on LOP method, which is implemented in non-recursive way, and only needs computing and flipping.
An almost distribution-independent incremental Delaunay triangulation algorithm
A new incremental insertion algorithm for constructing a Delaunay triangulation that is fast and practically independent of the distribution of input points, it is not memory demanding, and it is numerically stable and easy to implement is presented.
Novel parallel algorithm for constructing Delaunay triangulation based on a twofold-divide-and-conquer scheme
The results show that the proposed parallel algorithm is efficient for constructing the Delaunay triangulation with a good speed-up.
I/O-Efficient Construction of Constrained Delaunay Triangulations
This paper designed and implemented an I/O-efficient algorithm for constructing constrained Delaunay triangulations and shows that the algorithm is significantly faster than existing implementations.
A divide-and-conquer Delaunay triangulation algorithm with a vertex array and flip operations in two-dimensional space
This work proposes an array-based data structure for triangulation that arranges sites into a permutation vector that represents a kdtree with an array and indicates that the computational efficiency is comparable to the previous divide-and-conquer algorithms.
A Comparison of Plane Sweep Delaunay Triangulation Algorithms
This paper presents a survey as well as a new sweep-circle algorithm, on plane sweep algorithms for computing the Delaunay triangulation, and test implementations of these algorithms on a number of uniform and none-uniform distributed sites.
Parallel divide‐and‐conquer scheme for 2D Delaunay triangulation
Experimental results on an IBM SP2 show that a parallel efficiency of 44–95% for general distributions can be attained on a 16‐node distributed memory system.


Two algorithms for constructing a Delaunay triangulation
This paper provides a unified discussion of the Delaunay triangulation and two algorithms are presented for constructing the triangulations over a planar set ofN points.
Delaunay triangulation and the convex hull ofn points in expected linear time
An algorithm is presented which produces a Delaunay triangulation ofn points in the Euclidean plane in expected linear time and treats most of the non-uniform distributions.
Closest-point problems
  • M. Shamos, Dan Hoey
  • Computer Science
    16th Annual Symposium on Foundations of Computer Science (sfcs 1975)
  • 1975
The purpose of this paper is to introduce a single geometric structure, called the Voronoi diagram, which can be constructed rapidly and contains all of the relevant proximity information in only linear space, and is used to obtain O(N log N) algorithms for most of the problems considered.
Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams
Two algorithms are given, one that constructs the Voronoi diagram of the given sites, and another that inserts a new site in O(n) time, based on the use of the Vor onoi dual, the Delaunay triangulation, and are simple enough to be of practical value.
Two-Dimensional Voronoi Diagrams in the Lp-Metric
Many proximity problems revolving a set of points, such as finding the nearest neighbor of a given point, finding the minimum spamung tree, findmg the smallest circle enclosing the point set, etc., can be solved very efficiently via the Voronoi diagram.
Computing Dirichlet Tessellations in the Plane
A recursive algorithm for computing the Dirichlet tessellation in a highly efficient way is described, and the problems which arise in its implementation are discussed.
Optimal Expected-Time Algorithms for Closest Point Problems
Algorithms for solving a number of closest-point problems in k- space, including nearest neighbor searching, finding all nearest neighbors, and computing planar minimum spanning trees can be implemented to solve practical problems very efficiently.
A fast algorithm for the Voronoi diagram is proposed along with the performance evaluation by extensive computational experiments, and it is shown that the proposed algorithm runs in linear time on the average.
Voronoi Diagrams in L1 (Linfty) Metrics with 2-Dimensional Storage Applications
It is shown in this paper that there exists a natural isometry between the L_1 and L_\infty metrics, which implies the existence of a polynomial time algorithm for the OPP in one metric and the existence for the same problem in the other metric.
An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees
A mmmaal spammuag tree for P can be derived from a Voronot diagram for P m hnear tmae by using prewously known results.