A note on the all nearest-neighbor problem for convex polygons
From MaRDI portal
Publication:1254857
DOI10.1016/0020-0190(79)90021-8zbMath0399.68071MaRDI QIDQ1254857
Publication date: 1979
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(79)90021-8
68Q25: Analysis of algorithms and problem complexity
52A10: Convex sets in (2) dimensions (including convex curves)
68R99: Discrete mathematics in relation to computer science
Related Items
Optimal parallel algorithms for point-set and polygon problems, Selection and sorting in totally monotone arrays