Algorithm for finding k-nearest neighbors based on octree segmentation in space

DOI10.3724/SP.J.1087.2008.02046zbMath1175.68493OpenAlexW2010313664MaRDI QIDQ3647485

Haichao Zhang, Chao Li, Miao Huang

Publication date: 22 November 2009

Published in: Journal of Computer Applications (Search for Journal in Brave)

Full work available at URL: http://www.computerapplications.com.cn/EN/abstract/abstract11736.shtml

zbMATH Keywords

surface reconstructionoctreebounding box\(k\)-neighbor

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

This page was built for publication: Algorithm for finding k-nearest neighbors based on octree segmentation in space