The upper envelope of Voronoi surfaces and its applications
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Arrangements of segments that share endpoints: single face results
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Computing a face in an arrangement of line segments
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Tail estimates for the space complexity of randomized incremental algorithms
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Combinatorial complexity of translating a box in polyhedral 3-space
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Almost tight upper bounds for the single cell and zone problems in three dimensions
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
On lazy randomized incremental construction
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
Recent Developments in the Theory of Arrangements of Surfaces
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Preprocessing chains for fast dihedral rotations is hard or even impossible
Computational Geometry: Theory and Applications
A New Cell-subdivision Approach to Plan Free Translations in Cluttered Environments
Journal of Intelligent and Robotic Systems
Almost tight bound for a single cell in an arrangement of convex polyhedra in R3
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Pianos are not flat: rigid motion planning in three dimensions
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A geometric framework for solving subsequence problems in computational biology efficiently
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |