Abstract:
This paper reports about the development of two provably correct approximate algorithms which calculate the Euclidean shortest path (ESP) within a given cube-curve with arbitrary accuracy, defined by epsilon >0, and in time complexity kappa(epsilon) O(n), where kappa(epsilon) is the length difference between the path used for initialization and the minimum-length path, divided by epsilon. A run-time diagram also illustrates this linear-time behavior of the implemented ESP algorithm.
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).