Diameter, width, closest line pair, and parametric searching
SCG '92 Proceedings of the eighth 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
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
Efficient collision detection for moving polyhedra
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
Ray shooting amidst convex polytopes in three dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
On the number of congruent simplices in a point
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Recent Developments in the Theory of Arrangements of Surfaces
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
New constructions of weak epsilon-nets
Proceedings of the nineteenth annual symposium on Computational geometry
Proceedings of the nineteenth annual symposium on Computational geometry
Efficient algorithms for bichromatic separability
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for bichromatic separability
ACM Transactions on Algorithms (TALG)
Ad-hoc top-k query answering for data streams
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Linear data structures for fast ray-shooting amidst convex polyhedra
ESA'07 Proceedings of the 15th annual European conference on Algorithms
| Hi-index | 0.00 |