Path: utzoo!mnetor!tmsoft!torsqnt!jarvis.csri.toronto.edu!rutgers!apple!gem.mps.ohio-state.edu!uwm.edu!bionet!agate!shelby!polya!anaconda.stanford.edu!sumane From: sumane@anaconda.stanford.edu (Thilaka Sumanaweera) Newsgroups: comp.graphics Subject: Polygon Trianguation Pointers Message-ID: <11859@polya.Stanford.EDU> Date: 20 Sep 89 16:56:26 GMT Sender: USENET News System Reply-To: sumane@anaconda.stanford.edu (Thilaka Sumanaweera) Organization: Stanford University Lines: 23 For those of you who wanted some pointers in Polygon Triangulation, here are some: 1. An introduction to Delaunay Triangulation is in the book: Computational Geometry, An Introduction - Franco O. Preparata, Michael Ian Shamos. Springer-Verlag 2. The way to introduce new points to the set so that the Delaunay Trianguation contains the edges of the polygon is in pp 5-7 of: Shape Reconstruction from Planar Cross Sections - Jean-Daniel Boissonnat, Journal of Computer Vision, Graphics and Image Processsing 44, pp 1-29, 1988 3. A simple algorithm to implement 2D-Delaunay Trianguation is in: An Implementation of Watson's Algorithm for Computing 2-dimensional Delaunay Triangulations - Sloan and Houlsby - Advanced Engineering Software, 1984, Vol 6, No 4. (This is a journal in the UK) Good luck! Thilaka