dc.contributor.author |
Li, Fajie |
en |
dc.contributor.author |
Klette, Reinhard |
en |
dc.date.accessioned |
2008-08-21T01:56:28Z |
en |
dc.date.available |
2008-08-21T01:56:28Z |
en |
dc.date.issued |
2007 |
en |
dc.identifier.citation |
Communication and Information Technology Research Technical Report 204, (2007) |
en |
dc.identifier.issn |
1178-3541 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/2754 |
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 |
Let p and q be two points on the surface of a polytope P . This report provides a rubberband algorithm for computing a Euclidean shortest path between p and q (surface ESP) that is contained on the surface of P . The algorithm has k1(e) · k2(e) · O(n^2) time complexity, where n is the number of vertices of P , ki(e) = (L0i - Li )/e, for the true length Li of some shortest path with initial (polygonal path) length L0i (used when approximating this shortest path), for i = 1, 2. Rubberband algorithms follow a straightforward design strategy, and the proposed algorithm is easy to implement and thus of importance for applications, e.g. when analyzing 3D ob jects in 3D image analysis (such as in biomedical or industrial image analysis, using 3D image scanners). |
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-204.pdf |
en |
dc.title |
Approximate ESPs on Surfaces of Polytopes Using a Rubberband Algorithm |
en |
dc.type |
Technical Report |
en |
dc.subject.marsden |
Fields of Research::280000 Information, Computing and Communication Sciences |
en |