Applications of random sampling to on-line algorithms in computational geometry

This publication has 11 references indexed in Scilit:

• Combinatorial complexity bounds for arrangements of curves and spheres
  Discrete & Computational Geometry, 1990
• On the construction of abstract voronoi diagrams
  Published by Springer Nature ,1990
• Applications of random sampling in computational geometry, II
  Discrete & Computational Geometry, 1989
• Higher-dimensional Voronoi diagrams in linear expected time
  Published by Association for Computing Machinery (ACM) ,1989
• An optimal algorithm for intersecting line segments in the plane
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1988
• Algorithms in Combinatorial Geometry
  Published by Springer Nature ,1987
• The hierarchical representation of objects: the Delaunay tree
  Published by Association for Computing Machinery (ACM) ,1986
• Constructing higher-dimensional convex hulls at logarithmic cost per face
  Published by Association for Computing Machinery (ACM) ,1986
• Constructing the visibility graph for n-line segments in O(n2) time
  Information Processing Letters, 1985
• Simple On-Line Algorithms for Convex Polygons
  Published by Elsevier ,1985