On finding p-th nearest neighbours of scattered points in two dimensions for small p

DOI10.1016/S0167-8396(00)00009-1MaRDI QIDQ1978694zbMATH OpenFDO

Authors G. Goodsell

Publication date 4 June 2000

Published in Computer Aided Geometric Design (Search for Journal in Brave)

zbMATH Keywords

interpolationDelaunay triangulationVoronoi diagramnearest neighbourscontouringDirichlet tessellationgeographic information systems

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Algorithm for finding all \(k\) nearest neighbors
• SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS
• Finding nearest neighbors with Voronoi tessellations
• Iterated nearest neighbors and finding minimal polytopes
• scientific article; zbMATH DE number 437530

Cited in

(3)

• Image classification based on quantum K-nearest-neighbor algorithm
• A practical approach to the 2D incremental nearest-point problem suitable for different point distributions
• Algorithm for finding all \(k\) nearest neighbors

This page was built for publication: On finding \(p\)-th nearest neighbours of scattered points in two dimensions for small \(p\)

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