vcgKDtree

perform kdtree search for 3D-coordinates.

Operations on triangular meshes based on 'VCGLIB'. This package
integrates nicely with the R-package 'rgl' to render the meshes processed by
'Rvcg'. The Visualization and Computer Graphics Library (VCG for short) is
an open source portable C++ templated library for manipulation, processing
and displaying with OpenGL of triangle and tetrahedral meshes. The library,
composed by more than 100k lines of code, is released under the GPL license,
and it is the base of most of the software tools of the Visual Computing Lab of
the Italian National Research Council Institute ISTI <https://vcg.isti.cnr.it/>,
like 'metro' and 'MeshLab'. The 'VCGLIB' source is pulled from trunk
<https://github.com/cnr-isti-vclab/vcglib> and patched to work with options
determined by the configure script as well as to work with the header files
included by 'RcppEigen'.

Stefan Schlager

Rvcg

Manipulations of Triangular Meshes Based on the 'VCGLIB' API

Girinon Francois

Tim Schaefer

Zhengjia Wang

vcgKDtree function

<dl><dt>target</dt>
<dd>n x 3 matrix with 3D coordinates or mesh of class "mesh3d". These coordinates are to be searched.</dd>
<dt>query</dt>
<dd>m x 3 matrix with 3D coordinates or mesh of class "mesh3d". We seach the closest coordinates in <code>target</code> for each of these.</dd>
<dt>k</dt>
<dd>number of neighbours to find</dd>
<dt>nofPoints</dt>
<dd>integer: number of points per cell in the kd-tree (don't change unless you know what you are doing!)</dd>
<dt>maxDepth</dt>
<dd>integer: depth of the kd-tree (don't change unless you know what you are doing!)</dd>
<dt>threads</dt>
<dd>integer: threads to use in closest point search.</dd></dl>

Arguments

perform kdtree search for 3D-coordinates. — vcgKDtree

<dl>

<dt>target</dt>
<dd>n x 3 matrix with 3D coordinates or mesh of class "mesh3d". These coordinates are to be searched.</dd>


<dt>query</dt>
<dd>m x 3 matrix with 3D coordinates or mesh of class "mesh3d". We seach the closest coordinates in <code>target</code> for each of these.</dd>


<dt>k</dt>
<dd>number of neighbours to find</dd>


<dt>nofPoints</dt>
<dd>integer: number of points per cell in the kd-tree (don't change unless you know what you are doing!)</dd>


<dt>maxDepth</dt>
<dd>integer: depth of the kd-tree (don't change unless you know what you are doing!)</dd>


<dt>threads</dt>
<dd>integer: threads to use in closest point search.</dd>

</dl>

vcgKDtree: perform kdtree search for 3D-coordinates.

Description

Usage

Value

Arguments