home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!news.tek.com!ogicse!emory!utkcs2!willis1.cis.uab.edu!sloan
- From: sloan@cis.uab.edu (Kenneth Sloan)
- Newsgroups: comp.graphics
- Subject: Re: polyhedron/polyhedron intersection
- Keywords: 3d graphics, intersection
- Message-ID: <1992Nov11.040142.9570@cis.uab.edu>
- Date: 11 Nov 92 04:01:42 GMT
- Article-I.D.: cis.1992Nov11.040142.9570
- References: <1992Nov10.192804.13981@zip.eecs.umich.edu> <1992Nov10.221943.18792@sophia.smith.edu>
- Organization: CIS, University of Alabama at Birmingham
- Lines: 22
-
- In article <1992Nov10.221943.18792@sophia.smith.edu> orourke@sophia.smith.edu (Joseph O'Rourke) writes:
- >In article <1992Nov10.192804.13981@zip.eecs.umich.edu> katkere@engin.umich.edu writes:
- >>I am looking for code/ideas for finding if two polyhedrons intersect.
- >
- >@article{CD
- >, author = "B. Chazelle and D. P. Dobkin"
- >, title = "Intersection of convex objects in two and three dimensions"
- >, journal = "J. ACM"
- >, volume = 34
- >, year = 1987
- >, pages = "1--27"
- >}
-
- But Joe...what if the polyhedra aren't convex?
-
-
-
- --
- Kenneth Sloan Computer and Information Sciences
- sloan@cis.uab.edu University of Alabama at Birmingham
- (205) 934-2213 115A Campbell Hall, UAB Station
- (205) 934-5473 FAX Birmingham, AL 35294-1170
-