Randomized incremental construction of Delaunay and Voronoi diagrams

This publication has 17 references indexed in Scilit:

• On the construction of abstract voronoi diagrams
  Published by Springer Nature ,1990
• Circles through two points that always enclose many points
  Geometriae Dedicata, 1989
• Fining k points with minimum spanning trees and related problems
  Published by Association for Computing Machinery (ACM) ,1989
• A sweepline algorithm for Voronoi diagrams
  Algorithmica, 1987
• Optimal Point Location in a Monotone Subdivision
  SIAM Journal on Computing, 1986
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
  ACM Transactions on Graphics, 1985
• Optimal Search in Planar Subdivisions
  SIAM Journal on Computing, 1983
• Optimal Expected-Time Algorithms for Closest Point Problems
  ACM Transactions on Mathematical Software, 1980
• Computing Dirichlet Tessellations in the Plane
  The Computer Journal, 1978
• Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Deuxième mémoire. Recherches sur les parallélloèdres primitifs.
  Journal für die reine und angewandte Mathematik (Crelles Journal), 1908