Comments on the all nearest-neighbor problem for convex polygons

MaRDI QIDQ600104zbMATH OpenFDO

Authors Alain Fournier, Zvi Kedem

Publication date 1979

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

algorithm to find all nearest-neighbors of vertices of a convex polygondecomposition of convex polygons into polygons with semi-circle property

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Convex sets in (2) dimensions (including convex curves) (52A10)

Cited in

(4)

• The symmetric all-furthest-neighbor problem
• Optimal parallel algorithms for point-set and polygon problems
• Complexity, convexity, and unimodality
• Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm

This page was built for publication: Comments on the all nearest-neighbor problem for convex polygons

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