The symmetric all-furthest-neighbor problem

DOI10.1016/0898-1221(83)90139-6zbMath0533.51007OpenAlexW2147150872MaRDI QIDQ789727

Godfried T. Toussaint

Publication date: 1983

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(83)90139-6

zbMATH Keywords

Voronoi edgeEuclidean distancePlanar polygonunimodal polygon

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10) Euclidean geometries (general) and generalizations (51M05)

Related Items (6)

Geometric applications of a matrix-searching algorithm ⋮ A linear time algorithm for finding all farthest neighbors in a convex polygon ⋮ Complexity, convexity, and unimodality ⋮ On the multimodality of distances in convex polygons ⋮ An efficient algorithm for the three-dimensional diameter problem ⋮ On the determination of all pairs of symmetric furthest neighbor vertices of a simple polygon

Cites Work

• Comments on the all nearest-neighbor problem for convex polygons
• A linear algorithm for finding the convex hull of a simple polygon
• The all nearest-neighbor problem for convex polygons
• A note on the all nearest-neighbor problem for convex polygons
• Measuring Concavity on a Rectangular Mosaic
• On Sets of Distances of n Points

This page was built for publication: The symmetric all-furthest-neighbor problem