Path: utzoo!yunexus!geac!syntron!jtsv16!uunet!seismo!sundc!pitstop!sun!amdcad!ames!mailrus!tut.cis.ohio-state.edu!spencer
From: spencer@tut.cis.ohio-state.edu (Stephen Spencer)
Newsgroups: comp.graphics
Subject: Re: Triangularization of Concaved Polygon? How???
Summary: i have such a reference
Message-ID: <25650@tut.cis.ohio-state.edu>
Date: 25 Oct 88 17:50:22 GMT
Article-I.D.: tut.25650
References: <58605ULC@PSUVM>
Organization: Ohio State Computer & Info Science
Lines: 19

In article <58605ULC@PSUVM>, ULC@PSUVM.BITNET writes:
> Hi there. Would someone either point me in the direction of a reference or
> suggest an algorithm to triangularize an arbitrarily concave/convex 
> nonintersecting flat polygon????

If the polygon is convex, triangles (although not optimal) can be created
by forming new polygons from vertices (1,2,3),(1,3,4),(1,4,5),...,(1,(n-1),n)
where there are 'n' vertices in the original polygon.

For a reference on how to (a) determine whether a polygon is concave or 
convex, and (b) how to split a concave polygon into convex polygons, try
David Rogers' "Procedural Elements for Computer Graphics," pp. 146-152.


-- 
Stephen Spencer, Supercomputer Graphics Research Specialist I
Advanced Computing Center for the Arts and Design (ACCAD)
The Ohio State University               | (614) 292-3416
1224 Kinnear Road, Columbus OH 43212    | spencer@tut.cis.ohio-state.edu