tsearch

Triangulation, e.g. produced by <code>t = delaunayn(cbind(x, y))</code>

If <code>TRUE</code> return barycentric coordinates as well as index
of triangle.

bary

For <code>t = delaunay(cbind(x, y))</code>, where <code>(x, y)</code> is a 2D set of
points, <code>tsearch(x, y, t, xi, yi)</code> finds the index in <code>t</code>
containing the points <code>(xi, yi)</code>.  For points outside the convex hull
the index is <code>NA</code>.

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.

tsearch: Search for the enclosing Delaunay convex hull

Description

Usage

Arguments

Value

See Also