Re: Detect a point inside a convex hull in high dimension
- From: ellieandrogerxyzzy@xxxxxxxxxxxxxxxxxxxxxx (Roger Stafford)
- Date: Sat, 04 Mar 2006 15:54:33 GMT
In article <1141481517.499971.148870@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
"kotya" <kotya3d@xxxxxxxxx> wrote:
How about the following?-----------------------
% X is your original set
% p is your new point
% is_in -- the answer
is_in = CONVHULLN(X) == CONVHULLN([X; p])
Valik
I worry about how "reproducible" the 'convhulln' algorithm is in this
respect. If we add an additional point to the set which lies inside its
convex hull, though the algorithm might generate the same set of facits,
they could be produced in a different order, or worse, the permutation of
points within each facit might be altered. I don't know enough about the
inner working of the 'qhull' algorithm to guarantee that that couldn't
happen. This would mean that a simple '==' operation would not suffice.
(Remove "xyzzy" and ".invalid" to send me email.)
Roger Stafford
.
- References:
- Detect a point inside a convex hull in high dimension
- From: weihua xiong
- Re: Detect a point inside a convex hull in high dimension
- From: kotya
- Detect a point inside a convex hull in high dimension
- Prev by Date: Re: Detect a point inside a convex hull in high dimension
- Next by Date: Re: Detect a point inside a convex hull in high dimension
- Previous by thread: Re: Detect a point inside a convex hull in high dimension
- Next by thread: 'improfile' really drives me crazy
- Index(es):
Relevant Pages
|
