Fully dynamic delaunay triangulation in logarithmic expected time per operation

This publication has 11 references indexed in Scilit:

• Dynamic maintenance of geometric structures made easy
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• On levels in arrangements and voronoi diagrams
  Discrete & Computational Geometry, 1991
• On the construction of abstract voronoi diagrams
  Discrete & Computational Geometry, 1991
• A linear-time algorithm for computing the voronoi diagram of a convex polygon
  Discrete & Computational Geometry, 1989
• A sweepline algorithm for Voronoi diagrams
  Algorithmica, 1987
• The hierarchical representation of objects: the Delaunay tree
  Published by Association for Computing Machinery (ACM) ,1986
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
  ACM Transactions on Graphics, 1985
• Two algorithms for constructing a Delaunay triangulation
  International Journal of Parallel Programming, 1980
• Computing Dirichlet Tessellations in the Plane
  The Computer Journal, 1978
• Design and implementation of an efficient priority queue
  Theory of Computing Systems, 1976