The all nearest-neighbor problem for convex polygons
From MaRDI portal
Publication:1250433
DOI10.1016/0020-0190(78)90066-2zbMath0387.52001OpenAlexW2035300538MaRDI QIDQ1250433
Publication date: 1978
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(78)90066-2
Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items
Selection and sorting in totally monotone arrays ⋮ On approximation behavior of the greedy triangulation for convex polygons ⋮ Geometric applications of a matrix-searching algorithm ⋮ DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES ⋮ Complexity, convexity, and unimodality ⋮ Applications of generalized matrix searching to geometric algorithms ⋮ Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm ⋮ Dilation-Optimal Edge Deletion in Polygonal Cycles ⋮ Optimal parallel algorithms for point-set and polygon problems ⋮ Optimal time bounds for some proximity problems in the plane ⋮ On finding the convex hull of a simple polygon ⋮ A note on the all nearest-neighbor problem for convex polygons ⋮ Heuristics for optimum binary search trees and minimum weight triangulation problems ⋮ A note on the proof of a concurrent program ⋮ An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons ⋮ The symmetric all-furthest-neighbor problem
Cites Work
