Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm
SIAM Journal on Computing
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Computational geometry: an introduction
Computational geometry: an introduction
Planar point location using persistent search trees
Communications of the ACM
Searching and sorting similar lists
Journal of Algorithms
Optimal point location in a monotone subdivision
SIAM Journal on Computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
The complexity of robot motion planning
The complexity of robot motion planning
Fully dynamic point location in a monotone subdivision
SIAM Journal on Computing
A fast Las Vegas algorithm for triangulating a simple polygon
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Efficient binary space partitions for hidden-surface removal and solid modeling
Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
Hidden surface removal with respect to a moving view point
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Dynamic trees and dynamic point location
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Algorithmic motion planning in robotics
Handbook of theoretical computer science (vol. A)
Cutting hyperplane arrangements
Discrete & Computational Geometry
Triangulating a simple polygon in linear time
Discrete & Computational Geometry
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Range searching with efficient hierarchical cuttings
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Ray shooting in convex polytopes
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
An optimal algorithm for intersecting line segments in the plane
Journal of the ACM (JACM)
Cutting hyperplanes for divide-and-conquer
Discrete & Computational Geometry
Robot Motion Planning
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Computing faces in segment and simplex arrangements
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Construction of 1-d lower envelopes and applications
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
| Hi-index | 0.00 |