feasible.point: Find point in intersection of convex hulls
In geometry: Mesh Generation and Surface Tessellation
feasible.point R Documentation
Find point in intersection of convex hulls
Description
Find point that lies somewhere in interesction of two convex
hulls. If such a point does not exist, return NA. The
feasible point is found using a linear program similar to the one
suggested at ../doc/qhull/html/qhalf.html#notes
Usage
feasible.point(ch1, ch2, tol = 0)
Arguments
ch1
First convex hull with normals
ch2
Second convex hull with normals
tol
The point must be at least this far within the facets
of both convex hulls
geometry documentation built on Feb. 16, 2023, 10:08 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
| feasible.point | R Documentation |
Find point in intersection of convex hulls
Description
Find point that lies somewhere in interesction of two convex
hulls. If such a point does not exist, return NA. The
feasible point is found using a linear program similar to the one
suggested at ../doc/qhull/html/qhalf.html#notes
Usage
feasible.point(ch1, ch2, tol = 0)
Arguments
ch1 |
First convex hull with normals |
ch2 |
Second convex hull with normals |
tol |
The point must be at least this far within the facets of both convex hulls |
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.