Approximation of 3D Shortest Polygons in Simple Cube Curves

Bülow, Thomas; Klette, Reinhard

dc.contributor.author	Bülow, Thomas	en
dc.contributor.author	Klette, Reinhard	en
dc.date.accessioned	2008-08-21T01:55:38Z	en
dc.date.available	2008-08-21T01:55:38Z	en
dc.date.issued	2001	en
dc.identifier.citation	Communication and Information Technology Research Technical Report 91, (2001)	en
dc.identifier.issn	1178-3654	en
dc.identifier.uri	http://hdl.handle.net/2292/2692	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	One possible denition of the length of a digitized curve in 3D is the length of the shortest polygonal curve lying entirely in a cube curve. In earlier work the authors proposed an iterative algorithm for the calculation of this minimal length polygonal curve MLP. This paper reviews the algorithm and suggests methods to speed it up by reducing the set of possible locations of vertices of the MLP or by directly calculating MLP vertices in specific situations. Altogether the paper suggests an in depth analysis of cube curves.	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/2001/CITR-TR-91.pdf	en
dc.title	Approximation of 3D Shortest Polygons in Simple Cube Curves	en
dc.type	Technical Report	en
dc.subject.marsden	Fields of Research::280000 Information, Computing and Communication Sciences	en