tsearchn

An <code>n</code>-by-<code>d</code> matrix.  The rows of <code>x</code>
represent <code>n</code> points in <code>d</code>-dimensional space.

A <code>m</code>-by-<code>d+1</code> matrix. A row of <code>t</code>
contains indices into <code>x</code> of the vertices of a
<code>d</code>-dimensional simplex. <code>t</code> is usually the output of
delaunayn.

An <code>ni</code>-by-<code>d</code> matrix.  The rows of
<code>xi</code> represent <code>n</code> points in <code>d</code>-dimensional
space whose positions in the mesh are being sought.

If the data is in 2D, use the fast C-based
<code>tsearch</code> function to produce the results.

fast

For <code>t = delaunayn(x)</code>, where <code>x</code> is a set of points in
<code>d</code> dimensions, <code>tsearchn(x, t, xi)</code> finds the index
in <code>t</code> containing the points <code>xi</code>. For points outside
the convex hull, <code>idx</code> is <code>NA</code>. <code>tsearchn</code> also
returns the barycentric coordinates <code>p</code> of the enclosing
triangles.

This package makes the qhull library (www.qhull.org)
        available in R, in a similar manner as in Octave and MATLAB.
        Qhull computes convex hulls, Delaunay triangulations, halfspace
        intersections about a point, Voronoi diagrams, furthest-site
        Delaunay triangulations, and furthest-site Voronoi diagrams. It
        runs in 2-d, 3-d, 4-d, and higher dimensions. It implements the
        Quickhull algorithm for computing the convex hull. Qhull does
        not support constrained Delaunay triangulations, or mesh
        generation of non-convex objects, but the package does include
        some R functions that allow for this. Currently the package
        only gives access to Delaunay triangulation and convex hull
        computation.

tsearchn: Search for the enclosing Delaunay convex hull

Description

Usage

Arguments

Value

See Also