Separating two simple polygons by a sequence of translations
Discrete & Computational Geometry
Combinatorial complexity bounds for arrangements of curves and spheres
Discrete & Computational Geometry - Special issue on the complexity of arrangements
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
On the general motion-planning problem with two degrees of freedom
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
On the construction of abstract Voronoi diagrams
Discrete & Computational Geometry
Small-dimensional linear programming and convex hulls made easy
Discrete & Computational Geometry
Computing a face in an arrangement of line segments
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Applications of random sampling to on-line algorithms in computational geometry
Discrete & Computational Geometry
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
On the randomized construction of the Delaunay tree
Theoretical Computer Science
On the zone theorem for hyperplane arrangements
SIAM Journal on Computing
Four results on randomized incremental constructions
Computational Geometry: Theory and Applications
Vertical decompositions for triangles in 3-space
SCG '94 Proceedings of the tenth 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
Constructing levels in arrangements and higher order Voronoi diagrams
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computing many faces in arrangements of lines and segments
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computing envelopes in four dimensions with applications
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
The overlay of lower envelopes in three dimensions and its applications
Proceedings of the eleventh annual symposium on Computational geometry
A new technique for analyzing substructures in arrangements
Proceedings of the eleventh annual symposium on Computational geometry
Efficient randomized algorithms for some geometric optimization problems
Proceedings of the eleventh annual symposium on Computational geometry
Computing faces in segment and simplex arrangements
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Probabilistic Voronoi diagrams for probabilistic moving nearest neighbor queries
Data & Knowledge Engineering
| Hi-index | 0.00 |