A point inside a polyhedron

Thread View: sci.math.num-analysis

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by samer Takriti Mon, 28 Sep 1992 20:41

#662

Author: samer Takriti
Date: Mon, 28 Sep 1992 20:41

9 lines
746 bytes

There was a question about checking whether a point is inside 
the convex hull of a given set of points or not. Some people
suggested using some methods that "shoot" a ray in order to
check whether the point is inside the hull or not. Can somebody
give the name of a reference(s) which describes this method ?
What is the complexity of such a method ? Can it be applied
in R^n ?
Thank you.
-Samer

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads