mesh.diff

mesh.union

mesh.intersect

A matrix with 2 columns (3 in <code>mesh.dsphere</code>), each row
representing a point in the plane.

vectorized function describing region A in the
union / intersection / difference

regionA

vectorized function describing region B in the
union / intersection / difference

regionB

additional arguments passed to <code>regionA</code> and
<code>regionB</code>

Compute the signed distances from points <code>p</code> to a region
defined by the difference, union or intersection of regions
specified by the functions <code>regionA</code> and <code>regionB</code>.
<code>regionA</code> and <code>regionB</code> must accept a matrix <code>p</code>
with 2 columns as their first argument, and must return a vector
of length <code>nrow(p)</code> containing the signed distances of the
supplied points in <code>p</code> to their respective regions.

Makes the 'Qhull' library <http://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 2D, 3D, 4D, 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.

David Sterratt

mesh.diff: Difference, union and intersection operation on two regions

Description

Usage

Arguments

Value

See Also