Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
A near-linear algorithm for the planar segment center problem
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Recent Developments in the Theory of Arrangements of Surfaces
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Using sparsification for parametric minimum spanning tree problems
Nordic Journal of Computing
Pianos are not flat: rigid motion planning in three dimensions
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Covering points with a polygon
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |