feasible.point

Find point that lies somewhere in interesction of two convex
hulls. If such a point does not exist, return <code>NA</code>. The
feasible point is found using a linear program similar to the one
suggested at <a href="/link/..%2Fdoc%2Fqhull%2Fhtml%2Fqhalf.html%23notes?package=geometry&version=0.5.0" data-mini-rdoc="geometry::../doc/qhull/html/qhalf.html#notes">../doc/qhull/html/qhalf.html#notes</a>

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

geometry

Mesh Generation and Surface Tessellation

Jean-Romain Roussel

C. B. Barber

Kai Habel

Raoul Grasman

Robert B. Gramacy

Pavlo Mozharovskyi

David C. Sterratt

feasible.point function

<dl><dt>ch1</dt>
<dd>First convex hull with normals</dd>
<dt>ch2</dt>
<dd>Second convex hull with normals</dd>
<dt>tol</dt>
<dd>The point must be at least this far within the facets
of both convex hulls</dd></dl>

Arguments

Find point that lies somewhere in interesction of two convex
hulls. If such a point does not exist, return <code>NA</code>. The
feasible point is found using a linear program similar to the one
suggested at <a href='../doc/qhull/html/qhalf.html#notes'>../doc/qhull/html/qhalf.html#notes</a>

Find point in intersection of convex hulls — feasible.point

<dl>

<dt>ch1</dt>
<dd>First convex hull with normals</dd>


<dt>ch2</dt>
<dd>Second convex hull with normals</dd>


<dt>tol</dt>
<dd>The point must be at least this far within the facets
of both convex hulls</dd>

</dl>

feasible.point: Find point in intersection of convex hulls

Description

Usage

Arguments