home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!ogicse!news.u.washington.edu!stein.u.washington.edu!chuckb
- From: chuckb@stein.u.washington.edu (Charles Bass)
- Newsgroups: comp.graphics
- Subject: Re: polyhedron/polyhedron intersection
- Keywords: 3d graphics, intersection
- Message-ID: <1992Nov11.071010.721@u.washington.edu>
- Date: 11 Nov 92 07:10:10 GMT
- Article-I.D.: u.1992Nov11.071010.721
- References: <1992Nov10.192804.13981@zip.eecs.umich.edu> <1992Nov10.221943.18792@sophia.smith.edu> <1992Nov11.040142.9570@cis.uab.edu>
- Sender: news@u.washington.edu (USENET News System)
- Organization: University of Washington
- Lines: 29
-
-
- I am using an algorithm developed at the University of
- Washington. It has been accepted for publication but as of
- today it is not known when it will be published.
-
- I use the routines to detect collisions between solid modeled
- objects in a real time simulation program. In general the
- routine has proven an improvement over our previous (n^2)
- routine. Some details:
-
- 1) It requires triangulated polygons.
- 2) It is well suited for checking collisions between moving
- objects (ones that don't overlap very much)
- 3) In practice the algorithm is very fast although the worst
- case looks to run in O((n^2)/2) time
- 4) Several "speed hacks" have been incorporated. These mostly
- are marginal but in the name of efficiency... (and less
- readable code ;-))
- 5) Convex hull information can marginally speed the test.
- 6) I did *not* implement an engulfment test. I don't have
- details on this process but could possibly provide a ref.
- For details email me.
-
-
- Chuck Bass |
- College of Forest-Systems Engineering |
- University of Washington | FAX (206)-685-3091
- Mailstop AR-10 | voice (206)-685-2198
- Seattle, WA 98195 | email chuckb@u.washington.edu
-