Find point in intersection of convex hulls
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
feasible.point(ch1, ch2, tol = 0)
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 |
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.