Smart Nearest Neighbors
logo

Please use this identifier to cite or link to this publication: http://hdl.handle.net/10380/3306
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:
https://github.com/daviddoria/SmartNearestNeighbors

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

Quick Comments


Resources
backyellow
Download All
Download Paper , View Paper

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

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

Share
backyellow
Share

Linked Publications more
backyellow
Importing Contours from DICOM-RT Structure Sets Importing Contours from DICOM-RT Structure Sets
by Dowling J., Malaterre M., Greer P.B., Salvado O.
Deformable Registration with Discontinuity Preservation using Multi-Scale MRF Deformable Registration with Discontinuity Preservation using Multi-Scale MRF
by Seo D., Van Baar J.

View license
Loading license...

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