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 translational motion planning in 3-space
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
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
An algorithm to compute the Minkowski sum outer-face of two simple polygons
Proceedings of the twelfth annual symposium on Computational geometry
Motion planning of a ball amid segments in three dimensions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Online point location in planar arrangements and its applications
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On-Line Zone Construction in Arrangements of Lines in the Plane
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Taking a Walk in a Planar Arrangement
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
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
| Hi-index | 0.00 |