article
Computing the extreme distances between two convex polygons
published
yes
Herbert
Edelsbrunner
author 3FB178DA-F248-11E8-B48F-1D18A9856A870000-0002-9823-6833
A polygon in the plane is convex if it contains all line segments connecting any two of its points. Let P and Q denote two convex polygons. The computational complexity of finding the minimum and maximum distance possible between two points p in P and q in Q is studied. An algorithm is described that determines the minimum distance (together with points p and q that realize it) in O(logm + logn) time, where m and n denote the number of vertices of P and Q, respectively. This is optimal in the worst case. For computing the maximum distance, a lower bound Ω(m + n) is proved. This bound is also shown to be best possible by establishing an upper bound of O(m + n).
Academic Press1985
eng
Journal of Algorithms
0196-6774
1090-267810.1016/0196-6774(85)90039-2
62213 - 224
yes
Edelsbrunner, Herbert. “Computing the Extreme Distances between Two Convex Polygons.” <i>Journal of Algorithms</i>. Academic Press, 1985. <a href="https://doi.org/10.1016/0196-6774(85)90039-2">https://doi.org/10.1016/0196-6774(85)90039-2</a>.
Edelsbrunner, H. (1985). Computing the extreme distances between two convex polygons. <i>Journal of Algorithms</i>. Academic Press. <a href="https://doi.org/10.1016/0196-6774(85)90039-2">https://doi.org/10.1016/0196-6774(85)90039-2</a>
Edelsbrunner, Herbert. “Computing the Extreme Distances between Two Convex Polygons.” <i>Journal of Algorithms</i>, vol. 6, no. 2, Academic Press, 1985, pp. 213–24, doi:<a href="https://doi.org/10.1016/0196-6774(85)90039-2">10.1016/0196-6774(85)90039-2</a>.
H. Edelsbrunner, “Computing the extreme distances between two convex polygons,” <i>Journal of Algorithms</i>, vol. 6, no. 2. Academic Press, pp. 213–224, 1985.
Edelsbrunner H. Computing the extreme distances between two convex polygons. <i>Journal of Algorithms</i>. 1985;6(2):213-224. doi:<a href="https://doi.org/10.1016/0196-6774(85)90039-2">10.1016/0196-6774(85)90039-2</a>
H. Edelsbrunner, Journal of Algorithms 6 (1985) 213–224.
Edelsbrunner H. 1985. Computing the extreme distances between two convex polygons. Journal of Algorithms. 6(2), 213–224.
41152018-12-11T12:07:01Z2022-01-31T10:44:41Z