Smart Nearest Neighbors

Please use this identifier to cite or link to this publication:
This document presents an implementation of two algorithms, Voronoi Neighbors and Binary Space Partition (BSP) Neighbors. These algorithms find neighbors of a point in a point set that are somehow ``better'' than a ``K nearest neighbors'' or a ``all neighbors within a radius'' query. This type of nearest neighbor query is more computationally expensive, but results in set of neighbors with more desirable properties. The BSP Neighbors search ensures that there is less local duplication, while the Voronoi Neighbors search ensures that the spatial arrangement of the neighbors is as uniform as possible.

These algorithms are explained in ``Point Primitives for Interactive Modeling and Processing of 3D Geometry''.

The code is available here:

There is no review at this time. Be the first to review this publication!

Quick Comments

Download All
Download Paper , View Paper

Statistics more
Global rating: starstarstarstarstar
Review rating: starstarstarstarstar [review]
Paper Quality: plus minus

Information more
Categories: PointSet, Resampling, Surface extraction
Keywords: NearestNeighbors, PointClouds
Export citation:


Linked Publications more
Importing Contours from DICOM-RT Structure Sets Importing Contours from DICOM-RT Structure Sets
by Dowling J., Malaterre M., Greer P.B., Salvado O.
Extracting Intersections of Coplanar Surfaces (Boolean-operation on touching meshes) Extracting Intersections of Coplanar Surfaces (Boolean-operation on touching meshes)
by Grothausmann R.

View license
Loading license...

Send a message to the author
ISSN 2328-3459
Powered by Midas