powered by
search an existing KD-tree
vcgSearchKDtree(kdtree, query, k, threads = 0)
a list with
integer matrices with indeces of closest points
corresponding distances
object of class vcgKDtree
atrix or triangular mesh containing coordinates
number of k-closest neighbours to query
integer: number of threads to use
vcgCreateKDtree
if (FALSE) { data(humface);data(dummyhead) mytree <- vcgCreateKDtree(humface) ## get indices and distances for 10 closest points. closest <- vcgSearchKDtree(mytree,dummyhead.mesh,k=10,threads=1) }
Run the code above in your browser using DataLab