home *** CD-ROM | disk | FTP | other *** search
- Xref: sparky comp.graphics.avs:912 comp.graphics.visualization:1770
- Newsgroups: comp.graphics.avs,comp.graphics.visualization
- Path: sparky!uunet!caen!sol.ctr.columbia.edu!aurora!larryg
- From: larryg@avs.com (Larry Gelberg)
- Subject: Re: Wanted: Information on the ASCII-geometry format from AVS
- References: <1992Nov11.183619.18397@news.tu-graz.ac.at>
- Sender: nobody@ctr.columbia.edu
- Organization: Advanced Visual Systems Inc.
- Date: Mon, 16 Nov 1992 15:34:05 GMT
- X-Newsreader: Tin 1.1 PL4
- Message-ID: <1992Nov16.153405.23334@sol.ctr.columbia.edu>
- X-Posted-From: aurora.avs.com
- NNTP-Posting-Host: sol.ctr.columbia.edu
- Lines: 23
-
- The example you posted seems to be two squares, not one. One square
- is at [[1,1,1], [1,1,-1], [1,-1,-1], [1,-1,1]], and the other is the
- same but with X=-1.
-
- The secret to understanding polytriangle strips is to realize that
- vertices are doubled on either side of a "break" in the strip. This
- creates two zero-area triangles (we call them "cobwebs") which are
- culled in our renderer and ignored by many others. If you wanted to
- convert a polytriangle strip to disjoint triangles, you probably
- want to skip over these zero-area triangles (easily identified by having
- two of the vertices being identical). Other than that, if the indexes
- of the strip are [1,2,3,4,5,6], then the triangles are: [1,2,3], [2,3,4],
- [3,4,5], [4,5,6]. I.e., there are N-2 triangles for a polytri strip
- of N vertices.
-
- Does this help?
- larryg
-
- --
- === Larry Gelberg ============================ larryg@avs.com =======
- Advanced Visual Systems Inc. (AVS Inc.)
- 300 Fifth Ave, Waltham, MA 02154
- ===== Tel: 617-890-4300 = Fax: 617-890-8287 =========================
-