Computing the extreme distances between two convex polygons
Journal of Algorithms
Topologically sweeping an arrangement
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Efficient algorithms for common transversals
Information Processing Letters
Lower bounds for line stabbing
Information Processing Letters
Stabbing pairwise disjoint translates in linear time
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Finding the upper envelope of n line segments in O(n log n) time
Information Processing Letters
Algorithms for high dimensional stabbing problems
Discrete Applied Mathematics - Computational combinatiorics
Ordered stabbing of pairwise disjoint convex in linear time
Discrete Applied Mathematics
An on-line algorithm for fitting straight lines between data ranges
Communications of the ACM
Weighted Orthogonal Linear L\infty-Approximation and Applications
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Geometric transforms for fast geometric algorithms
Geometric transforms for fast geometric algorithms
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Stabbers of line segments in the plane
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |