Computational geometry: an introduction
Computational geometry: an introduction
The ultimate planar convex hull algorithm
SIAM Journal on Computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Geometric permutations of disjoint translates of convex sets
Discrete Mathematics
Efficient algorithms for common transversals
Information Processing Letters
Output-size sensitive algorithms for constructive problems in computational geometry
Output-size sensitive algorithms for constructive problems in computational geometry
Proof of Gru¨nbaum's conjecture on common transversals for translates
Discrete & Computational Geometry
A generalization of Hadwiger's transversal theorem to intersecting sets
Discrete & Computational Geometry
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
An on-line algorithm for fitting straight lines between data ranges
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The combinatorial complexity of hyperplane transversals
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Computing shortest transversals of sets (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Helly theorems and generalized linear programming
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
In general, finding a line stabber for a family of n objects in the plane takes &ohgr;(n log n) time. However, we show how to find a line stabber for a family of n pairwise disjoint convex translates in the plane in linear time. Our algorithm still runs in optimal &Ogr; (n log n) time when the translates are not pairwise disjoint.