home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.graphics
- Path: sparky!uunet!caen!batcomputer!tasha.cheme.cornell.edu!elan
- From: elan@tasha.cheme.cornell.edu (Elan Feingold)
- Subject: Hidden Surface Removal
- Message-ID: <1992Jul30.142742.5874@tc.cornell.edu>
- Lines: 34
- Sender: news@tc.cornell.edu
- Nntp-Posting-Host: tasha.cheme.cornell.edu
- Reply-To: elan@tasha.cheme.cornell.edu (Elan Feingold)
- Organization: Cornell University
- Date: Thu, 30 Jul 1992 14:27:42 GMT
-
-
-
- I would appreciate if someone could either help me out or point me in the right
- direction with this problem.
-
- Basically, I have a bunch of polygons that don't intersect, sometimes in the
- form of a regular 2-D height field, and other times in other forms, like a
- sphere, cylinder, or other parametrically created objects. I have implemented
- a fast sort, but the problem is, scenes can be contructed for which a simple
- sort doesn't work. The polygons are 4 sided. Might it help to break them
- into triangles? Mathematica seems to do this and then plot them from, back
- to front, but this doesn't seem to work allways for me. Example:
-
-
-
- --\
- / / \
- / /\--
- / /
- --
-
- I don't know if this picture is enlightening. :) Basically I have a long
- polygon and then a smaller one going behind it. When the viewpoint is slightly
- above and to the right of the scene, the longer polygon is plotted first,
- messing up the scene. Can anyone help as far as an algorithm is concerned?
- Thanks loads in advance!
-
- --
- --------------------------------------------------------------------------|
- | Elan Feingold | Chevy Chase after being asked by a Howard Stern |
- | CS/EE Depts. | interviewer whether he still wore a toupee: |
- | Cornell University | "Ask him [Stern] if he wants me to put his |
- | Ithaca NY 14850 | dentist in a higher tax bracket." |
- --------------------------------------------------------------------------
-