vcgSearchKDtree {Rvcg}

search an existing KD-tree

Description

search an existing KD-tree

Usage

vcgSearchKDtree(kdtree, query, k, threads = 0)

Arguments

kdtree

object of class vcgKDtree

query

atrix or triangular mesh containing coordinates

k

number of k-closest neighbours to query

threads

integer: number of threads to use

Value

a list with

index

integer matrices with indeces of closest points

distances

corresponding distances

See Also

vcgCreateKDtree

Examples

## Not run: 
data(humface);data(dummyhead)
mytree <- vcgCreateKDtree(humface)
## get indices and distances for 10 closest points.
closest <- vcgSearchKDtree(mytree,dummyhead.mesh,k=10,threads=1)

## End(Not run)