home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #26 / NN_1992_26.iso / spool / comp / graphics / 11697 < prev    next >
Encoding:
Text File  |  1992-11-10  |  1.4 KB  |  33 lines
  1. Newsgroups: comp.graphics
  2. Path: sparky!uunet!caen!umeecs!krusty.eecs.umich.edu!katkere
  3. From: katkere@eecs.umich.edu (Arun L. Katkere)
  4. Subject: polyhedron/polyhedron intersection
  5. Message-ID: <1992Nov10.192804.13981@zip.eecs.umich.edu>
  6. Followup-To: comp.graphics
  7. Keywords: 3d graphics, intersection
  8. Sender: katkere@krusty.eecs.umich.edu (Arun L. Katkere)
  9. Reply-To: katkere@engin.umich.edu
  10. Organization: University of Michigan EECS Dept., Ann Arbor, MI
  11. Date: Tue, 10 Nov 1992 19:28:04 GMT
  12. Lines: 19
  13.  
  14. I am looking for code/ideas for finding if two polyhedrons intersect.
  15. I think that polygon/polygon intersection will be used as a building
  16. block for this. Is there a better way to do this? Can the sgi
  17. rendering engine be used in any way to do this? Where can I find
  18. code for polygon/polygon intersection?
  19.  
  20. I am not a c.g subscriber. But I searched thro' the FAQ, about 1300
  21. subject lines, some ftp sites and couldn't find any info on this. Any
  22. help will be appreciated.
  23.  
  24. Send replies to katkere@eecs.umich.edu.
  25. Thanks,
  26. -arun
  27. -- 
  28. +-----------------------------------------------------------------------------+
  29. | Arun Katkere                      |   The University of Michigan AI Lab     |
  30. | katkere@engin.umich.edu           |   147 ATL, 1101 Beal Avenue             |
  31. | O:(313)763-1563 | R:(313)761-9462 |   Ann Arbor, MI 48109-2110              |
  32. +-----------------------------------------------------------------------------+
  33.