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

DOI10.1016/S0167-8396(00)00009-1zbMath0938.68124MaRDI QIDQ1978694

G. Goodsell

Publication date: 4 June 2000

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

zbMATH Keywords

interpolationVoronoi diagramDirichlet tessellationDelaunay triangulationnearest neighbourscontouringgeographic 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)

Related Items (1)

Image classification based on quantum K-nearest-neighbor algorithm

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