A linear time algorithm for finding all farthest neighbors in a convex polygon (Q1123027): Difference between revisions

A linear-time algorithm is given to compute all most distant vertices for every vertex of a convex polygon. It is an extension of an algorithm from \textit{A. Aggarwal}, \textit{M. M. Klawe}, \textit{S. Moran}, \textit{P. Shor}, \textit{R. Wilber} [Algorithmica 2, 195-208 (1987; Zbl 0642.68078)] computing only one farthest neighbor per vertex. As a by-product a linear-time algorithm for all symmetric farthest neighbor pairs for a simple polygon is obtained (``symmetric'' means that the two vertices are farthest neighbors of each other).