An efficient algorithm for the Euclidean two-center problem
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Efficient algorithms for maximum regression depth
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Optimally computing a shortest weakly visible line segment inside a simple polygon
Computational Geometry: Theory and Applications
Capturing crossings: Convex hulls of segment and plane intersections
Information Processing Letters
Rotationally monotone polygons
Computational Geometry: Theory and Applications
Wedges in euclidean arrangements
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Hi-index | 0.89 |