From: sloan@cis.uab.edu (Kenneth Sloan) Newsgroups: comp.graphics.algorithms Subject: Re: Triangulation of polygons Date: 21 May 1997 19:17:08 GMT In article <33836160.167E@luc.ac.be>, Bruno Rassaerts wrote: >Hi, > >I am looking for information on triangulating polygons. When started >from a convex or non-convex (not self-intersecting) polygon the >algorithm shoud generate a list of triangles. It would realy be nice >if no points should be added but I don't think that's possible. For the theory, read the FAQ, and O'Rourke's book. For working code, have a look at: ftp.cis.uab.edu:pub/sloan/Software/triangulation there you will find source code to triangulate simple (non-intersecting) polygons (sorry, no holes, either) and also a handy-dandy program to generate test cases ("random" simple polygons of many vertices). Enjoy! (and please send back bug fixes, if you find a bug, and know how to fix it) -- Kenneth Sloan sloan@cis.uab.edu Computer and Information Sciences (205) 934-2213 University of Alabama at Birmingham FAX (205) 934-5473 Birmingham, AL 35294-1170 http://www.cis.uab.edu/info/faculty/sloan/ ============================================================================== From: "Ian Ashdown" Newsgroups: comp.graphics.algorithms Subject: Re: Triangulation of polygons Date: 22 May 1997 04:06:25 GMT Make that: ftp.cis.uab.edu/pub/sloan/Software/triangulation/src and thanks for making it available! -- Ian Ashdown, P. Eng. | READ THE BOOK! | Research & Development Manager | Radiosity: A Programmer's Perspective | Ledalite Architectural Products | Wiley & Sons 1994 | Visit http://www.ledalite.com | (Sneaky Internet Advertising) | [previous post quoted, now deleted -- djr]