The symmetric all-furthest-neighbor problem

DOI10.1016/0898-1221(83)90139-6MaRDI QIDQ789727zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A linear time algorithm for finding all farthest neighbors in a convex polygon
• On the Number of Furthest Neighbour Pairs in a Point Set
• Computing geodesic furthest neighbors in simple polygons
• The Number of Furthest Neighbour Pairs of a Finite Planar Set
• PARALLEL COMPUTATION OF INTERNAL AND EXTERNAL FARTHEST NEIGHBORS IN SIMPLE POLYGONS

Cites work

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

Cited in

(7)

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

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)