Path: utzoo!utgpu!attcan!uunet!seismo!sundc!pitstop!sun!amdcad!ames!mailrus!ukma!tut.cis.ohio-state.edu!rutgers!ucla-cs!rosen
From: rosen@lanai.cs.ucla.edu
Newsgroups: comp.graphics
Subject: Algorithms for point in polyhedron
Message-ID: <17505@shemp.CS.UCLA.EDU>
Date: 3 Nov 88 00:43:39 GMT
Sender: news@CS.UCLA.EDU
Reply-To: rosen@CS.UCLA.EDU ()
Distribution: na
Organization: UCLA Computer Science Department
Lines: 15

Does anyone have an algorithm (preferably code, more
preferably C code) for determining if a point is
inside a 6 faced (concave or/and convex) polyhedron
where each face is a quadrilateral?

If so, is the algorithm/code extendable to a 4 dimenstional
polytope of where each face is quadrilateral?

	Please mail me replies to
rosen@CS.UCLA.EDU
	thanks - Bruce

Bruce Rosen
	ARPA:   rosen@CS.UCLA.EDU
	UUCP:   ...!ucbvax!ucla-cs!rosen