A linear-time algorithm for computing the Voronoi diagram of a convex polygon
Discrete & Computational Geometry
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Computational Geometry: Theory and Applications
Triangulating a simple polygon in linear time
Discrete & Computational Geometry
Applications of random sampling to on-line algorithms in computational geometry
Discrete & Computational Geometry
An optimal algorithm for intersecting three-dimensional convex polyhedra
SIAM Journal on Computing
On the randomized construction of the Delaunay tree
Theoretical Computer Science
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Computing a single cell in the overlay of two simple polygons
Information Processing Letters
Triangulations in CGAL (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry
Linear-time triangulation of a simple polygon made easier via randomization
Proceedings of the sixteenth annual symposium on Computational geometry
Building Voronoi Diagrams for Convex Polygons in Linear Expected Time
Building Voronoi Diagrams for Convex Polygons in Linear Expected Time
| Hi-index | 0.00 |