Abstract
Given two disjoint convex polygons in standard representations, one can compute outer common tangents in logarithmic time without first obtaining a separating line. If the polygons are not disjoint, there is an additional factor of the logarithm of the intersection or convex hull, whichever is smaller.
Both authors supported in part by NSERC Research Grants. The second was also supported by a fellowship from the B.C. Advanced Systems Institute.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Pankaj K. Agarwal. Intersection and decomposition algorithms for planar arrangements. Cambridge University Press, 1991.
Bernard Chazelle and Leonidas J. Guibas. Visibility and intersection problems in plane geometry. Discrete & Computational Geometry, 4:551–581, 1989.
David P. Dobkin and David G. Kirkpatrick. Determining the separation of preprocessed polyhedra: A unified approach. In Seventeenth International Colloquium on Automata, Languages and Programming, number 443 in Lecture Notes in Computer Science, pages 400–413. Springer-Verlag, 1990.
H. Edelsbrunner. Computing the extreme distances between two convex polygons. Journal of Algorithms, 6:213–224, 1985.
Herbert Edelsbrunner, Leonidas Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, and Emo Welzl. Implicitly representing arrangements of lines or segments. Discrete & Computational Geometry, 4:433–466, 1989.
D. Gries and I. Stojmenović. A note on Graham's convex hull algorithm. Information Processing Letters, 25:323–327, 1987.
Leo Guibas, John Hershberger, and Jack Snoeyink. Compact interval trees: A data structure for convex hulls. International Journal of Computational Geometry & Applications, 1(1):1–22, 1991.
David Kirkpatrick and Jack Snoeyink. Tentative prune-and-search for computing Voronoi vertices. In Proceedings of the Ninth Annual ACM Symposium on Computational Geometry, pages 133–142, 1993.
M. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. Journal of Computer and System Sciences, 23:166–204, 1981.
Jorge Stolfi. Oriented projective geometry: A framework for geometric computations. Academic Press, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kirkpatrick, D., Snoeyink, J. (1995). Computing common tangents without a separating line. In: Akl, S.G., Dehne, F., Sack, JR., Santoro, N. (eds) Algorithms and Data Structures. WADS 1995. Lecture Notes in Computer Science, vol 955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60220-8_61
Download citation
DOI: https://doi.org/10.1007/3-540-60220-8_61
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60220-0
Online ISBN: 978-3-540-44747-4
eBook Packages: Springer Book Archive