Decomposing a Simple Polygon into Trapezoids

Li, Fajie; Klette, Reinhard

dc.contributor.author	Li, Fajie	en
dc.contributor.author	Klette, Reinhard	en
dc.date.accessioned	2008-08-21T01:56:40Z	en
dc.date.available	2008-08-21T01:56:40Z	en
dc.date.issued	2007	en
dc.identifier.citation	Communication and Information Technology Research Technical Report 199, (2007)	en
dc.identifier.issn	1178-3546	en
dc.identifier.uri	http://hdl.handle.net/2292/2771	en
dc.description	You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the original CITR web site; http://citr.auckland.ac.nz/techreports/ under terms that include this permission. All other rights are reserved by the author(s).	en
dc.description.abstract	Chazelle's triangulation \cite{BC1991} forms today the common basis for linear-time Euclidean shortest path (ESP) calculations (where start and end point are given within a simple polygon). This paper provides an alternative method for subdividing a simple polygon into ``basic shapes'', using trapezoids instead of triangles. The authors consider the presented method as being substantially simpler than the linear-time triangulation method. However, it requires a sorting step (of a subset of vertices of the given simple polygon); all the other subprocesses are linear time.	en
dc.publisher	CITR, The University of Auckland, New Zealand	en
dc.relation.ispartofseries	Communication and Information Technology Research (CITR) Technical Report Series	en
dc.rights	Copyright CITR, The University of Auckland. You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the original CITR web site under terms that include this permission. All other rights are reserved by the author(s).	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	http://citr.auckland.ac.nz/techreports/2007/CITR-TR-199.pdf	en
dc.title	Decomposing a Simple Polygon into Trapezoids	en
dc.type	Technical Report	en
dc.subject.marsden	Fields of Research::280000 Information, Computing and Communication Sciences	en