Nearest set

Back to Data structures

A nearest set is a concept which abstracts

a point-set $S$ in $RR^n$ ,
a way to search for the nearest neighbors of a point $p$ in $S$ .

Files

Nearest neighbors searching in a kd-tree

count_nearest.h

Nearest neighbors searching in a kd-tree

kdtree_nearestset.h

Nearest neighbors searching in a kd-tree

search_nearby.h

Nearest neighbors searching in a kd-tree

search_nearest.h

Nearest-neighbor search-structure

nearestset_concept.h

Number of points in a nearest-set

nearestset_n.h

Testing for nearest-set.

test_search_nearest.cpp