A linear time algorithm for finding all farthest neighbors in a convex polygon (Q1123027)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4108215
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time algorithm for finding all farthest neighbors in a convex polygon |
scientific article; zbMATH DE number 4108215 |
Statements
A linear time algorithm for finding all farthest neighbors in a convex polygon (English)
0 references
1989
0 references
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).
0 references
computational geometry
0 references
matrix searching
0 references
farthest neighbors
0 references
convex polygon
0 references
0.8406882882118225
0 references
0.8400022387504578
0 references
0.8400022387504578
0 references
0.8216843605041504
0 references
