The symmetric all-furthest-neighbor problem

DOI10.1016/0898-1221(83)90139-6zbMATH Open0533.51007OpenAlexW2147150872MaRDI QIDQ789727FDOQ789727

Godfried 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

Euclidean distancePlanar polygonunimodal polygonVoronoi edge

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)

Cites Work

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

Cited In (6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q789727)