A linear time algorithm for finding all farthest neighbors in a convex polygon (Q1123027): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Alok Aggarwal / rank | |||
| Property / author | |||
| Property / author: Alok Aggarwal / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(89)90103-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2083706317 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding the convex hull of a simple polygon / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The symmetric all-furthest-neighbor problem / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:57, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear time algorithm for finding all farthest neighbors in a convex polygon |
scientific article |
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
