Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utcs!mnetor!seismo!ut-sally!utah-cs!utah-gr!thomas
From: thomas@utah-gr.UUCP
Newsgroups: net.graphics
Subject: Re: Decomposing a polygon into a buncha trapezoids
Message-ID: <1763@utah-gr.UUCP>
Date: Tue, 15-Jul-86 18:36:23 EDT
Article-I.D.: utah-gr.1763
Posted: Tue Jul 15 18:36:23 1986
Date-Received: Wed, 16-Jul-86 03:53:13 EDT
References: <115@tslvax.UUCP>
Reply-To: thomas@utah-gr.UUCP (Spencer W. Thomas)
Distribution: net
Organization: University of Utah CS Dept
Lines: 17


Some references:
	"A Linear Time Algorithm for Triangulating a Point-Visible Polygon",
	T.C. Woo and S.Y. Shin, ACM Transactions on Graphics, Vol 4, # 1, 
	(January 1985).

	"Convex Decomposition of Simple Polygons", S.B. Tor and A.E.
	Middleditch, ACM TOG, Vol 3, # 4, (October 1984).

	"Triangulation and Shape Complexity", B. Chazelle and J. Incerpi,
	ACM TOG, Vol 3, #2, (April 1984).

	"Triangulating Simple Polygons and Equivalent Problems", 
	A. Fournier and D.Y. Montuno, ACM TOG, Vol 3, #2, (April 1984).

-- 
=Spencer   ({ihnp4,decvax}!utah-cs!thomas, thomas@utah-cs.ARPA)