A point inside a polyhedron

Article View: sci.math.num-analysis

Article #662

Back to sci.math.num-analysis Previous Next

#662

From: 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

Technical Details

Message-ID: <y2z-l!+@engin.umich.edu>

Path: arc1-ca.pugleaf.net!sparky!uunet!caen!takriti

Show Full Headers

Complete Article Headers

Newsgroups: sci.math.num-analysis
Path: arc1-ca.pugleaf.net!sparky!uunet!caen!takriti
From: takriti@engin.umich.edu (samer Takriti)
Subject: A point inside a polyhedron
Message-ID: <y2z-l!+@engin.umich.edu>
Date: Mon, 28 Sep 92 16:41:50 EDT
Organization: University of Michigan Engineering, Ann Arbor
Nntp-Posting-Host: fly.engin.umich.edu
Lines: 9