Abstract
Algorithms are developed for determining if a set of polyhedral objects inR 3 can be intersected by a common transversal (stabbing) line. It can be determined inO(n logn) time if a set ofn line segments in space has a line transversal, and such a transversal can be found in the same time bound. For a set of polyhedra with a total ofn vertices, we give anO(n 4 logn) algorithm for determining the existence of, and computing, a line transversal. Helly-type theorems for lines and segments are also given. In particular, it is shown that if every six of a set of lines in space are intersected by a common transversal, then the entire set has a common transversal.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Avis, D., Diameter Partitioning,Discrete and Computational Geometry, Vol. 1, pp. 265–276, 1986.
Avis, D. and Doskas, M., Algorithms for High-Dimensional Stabbing Problems, Technical Report SOCS 87.2, McGill University, Montreal, January 1987.
Avis, D. and Wenger, R., Algorithms for Line Stabbers in Space,Proceedings of the 3rd ACM Conference on Computational Geometry, pp. 300–307, Waterloo, 1987.
Borsuk, K.,Multidimensional Analytic Geometry, Polish Scientific Publishers, Warsaw, 1969.
Danzer, L., Grunbaum, B., and Klee, V.,Helly's Theorem and Its Relatives, Proceedings of Symposia in Pure Mathematics, pp. 100–181, American Mathematical Society, Providence, RI, 1963.
Dobkin, D. and Kirpatrick, D., Fast Detection of Polyhedral Intersection,Theoretical Computer Science, Vol. 27, pp. 241–253, 1983.
Edelsbrunner, H., Finding Transversals for Sets of Simple Geometric Figures,Theoretical Computer Science, Vol. 35, pp. 55–69, 1985.
Edelsbrunner, H., Maurer, H. A., Preparata, F. P., Rosenberg, A. L., Welzl, E., and Wood, D., Stabbing Line Segments,BIT, Vol. 22, pp. 274–281, 1982.
Edelsbrunner, H. and Sharir, M., The Maximum Number of Ways to Stabn Convex Nonintersecting Objects in the Plane is 2n–2,Discrete and Computational Geometry, to appear.
ElGindy, H. and Toussaint, G. T., Efficient Algorithms for Inserting and Deleting Edges from Triangulations,Proceedings of the International Conference on Foundations of Data Organization, Kyoto, May 22–24, 1985.
Goodman, J. E. and Pollack, R., Hadwiger's Transversal Theorem in Higher Dimensions,Journal of the American Mathematical Society, Vol. 1, to appear.
Hadwiger, H., Debrunner, H., and Klee, V.,Combinatorial Geometry in the Plane, Holt, Rinehart, and Winston, New York, 1964.
Katchalski, M., Thin Sets and Common Transversals,Journal of Geometry, Vol. 14, pp. 103–107, 1980.
Katchalski, M., Lewis, T., and Zaks, J., Geometric Permutations for Convex Sets,Discrete Mathematics, Vol. 54, pp. 271–284, 1985.
Preparata, F. P. and Shamos, M. I.,Computational Geometry, Springer-Verlag, New York, 1985.
Wenger, R., Upper Bounds on Geometric Permutations,Discrete and Computational Geometry, to appear.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Avis, D., Wenger, R. Polyhedral line transversals in space. Discrete Comput Geom 3, 257–265 (1988). https://doi.org/10.1007/BF02187911
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02187911