SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS

DOI10.1142/S0218195992000147zbMath0759.68033OpenAlexW2109157304WikidataQ60162793 ScholiaQ60162793MaRDI QIDQ4030349

Jörg-Rüdiger Sack, Robert L. Scot Drysdale, Matthew T. Dickerson

Publication date: 1 April 1993

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195992000147

zbMATH Keywords

selectionenumerationDelaunay triangulationnearest neighbors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Iterated nearest neighbors and finding minimal polytopes, Efficient construction of a bounded-degree spanner with low weight, A simple algorithm for enumerating longest distances in the plane, DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES, Algorithms for proximity problems in higher dimensions, Geometric Applications of Posets, Fast greedy triangulation algorithms., Proximity problems on line segments spanned by points, ON ENUMERATING AND SELECTING DISTANCES, Deformable spanners and applications, Triangulations intersect nicely, Geometric applications of posets, Extending range queries and nearest neighbors