home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.graphics
- Path: sparky!uunet!caen!batcomputer!cornell!deb
- From: deb@cs.cornell.edu (David Baraff)
- Subject: Re: Fast intersection DETECTION for convex polyhedra?
- Message-ID: <1992Jul23.213347.29219@cs.cornell.edu>
- Organization: Cornell Univ. CS Dept, Ithaca NY 14853
- References: <1992Jul9.134621.20715@fel.tno.nl> <jqsx0dj@rpi.edu> <25764@life.ai.mit.edu>
- Date: Thu, 23 Jul 1992 21:33:47 GMT
- Lines: 27
-
- sundar@fiber-one.ai.mit.edu (Sundar Narasimhan) writes:
-
- >In article <jqsx0dj@rpi.edu>, wrf@ecse.rpi.edu (Wm Randolph Franklin) writes:
- >|>
- >|> In article <1992Jul9.134621.20715@fel.tno.nl> on Thu, 9 Jul 92 13:46:21 GMT,
- >|> rxkc2@fel.tno.nl (R. Kiel) writes:
- >|>
- >|> > For a real-time visualisation system I need an algorithm that will
- >|> > tell me whether or not two convex polyhedra intersect.
- >|>
- >|> A separating plane for the two polyhedra exists iff they don't
- >|> intersect. This can be formulated as a linear programming problem and
- >|> solved. It should be reasonably fast.
- >I don't know if I responded to this already, but Lin and Canny's algorithm
- >is the fastest (and easiest to implement) I know of currently.
- >I'd like to hear if people know of others. (WRT approximation algs., the
- >ellipsoidal approximation of Elon Rimon, and Featherstone's 'swept bubble'
- >sphere approximation should also be pretty fast).
-
- At the risk of being self-promoting, check out
- the article "Curved Surfaces and Coherence for Non-penetrating
- Rigid Body Motion", in the 1990 SIGGRAPH conference proceedings.
- A discussion of convex polyhedra is covered in that paper.
-
- David Baraff
- deb@cs.cornell.edu
-
-