home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!sun-barr!cs.utexas.edu!usc!elroy.jpl.nasa.gov!swrinde!network.ucsd.edu!alex!spl
- From: spl@alex.uucp (Steve Lamont)
- Newsgroups: comp.graphics
- Subject: Re: Polygon Decomposition & Delaunay Triangulation
- Message-ID: <18qap0INNp8c@network.ucsd.edu>
- Date: 11 Sep 92 14:34:08 GMT
- References: <edwarda.716104366@bruce.cs.monash.edu.au> <92254.213045JIANGY@QUCDN.QueensU.CA>
- Organization: University of Calif., San Diego/Microscopy and Imaging Resource
- Lines: 19
- NNTP-Posting-Host: alex.ucsd.edu
-
- In article <92254.213045JIANGY@QUCDN.QueensU.CA> <JIANGY@QUCDN.QueensU.CA> writes:
- >I have exactly same problem as yours, and am still looking for the code
- >for optimal polygon triangulation. Besides, does any one know of a code
- >for constructing a surface from two adjacent contours? This similar
- >inquery for the later problem was brought up two weeks ago by someone
- >in the group. Still no clue yet.
-
- There's a good article on the subject in ACM Transactions on Graphics,
- April 1991 (V10, N2).
-
- "A triangulation algorithm from arbitrary shaped multiple planar
- contours." The authors are A. B. Ekoule, F. C. Peyrin, C. L. Odet.
-
- spl
- --
- Steve Lamont, SciViGuy -- (619) 534-7968 -- spl@dim.ucsd.edu
- UCSD Microscopy and Imaging Resource/UCSD Med School/La Jolla, CA 92093-0608
- "There was a time when tyrants feared/The new world of the free.
- Now freedom is afraid and shrieks/At tyranny." - "Brave New World," A. Macleish
-