by Li, F and Klette, R
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 ε > 0, and in time complexity k(ε) · σ(n), where k(ε) is the length difference between the path used for initialization and the minimum-length path, divided by ε. A run-time diagram also illustrates this linear-time behavior of the implemented ESP algorithm. © Springer-Verlag Berlin Heidelberg 2007.
Reference:
Euclidean shortest paths in simple cube curves at a glance (Li, F and Klette, R), In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 4673 LNCS, 2007.
Bibtex Entry:
@article{li2007euclideanglance,
author = "Li, F and Klette, R",
journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "661--668",
title = "Euclidean shortest paths in simple cube curves at a glance",
volume = "4673 LNCS",
year = "2007",
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 ε > 0, and in time complexity k(ε) · σ(n), where k(ε) is the length difference between the path used for initialization and the minimum-length path, divided by ε. A run-time diagram also illustrates this linear-time behavior of the implemented ESP algorithm. © Springer-Verlag Berlin Heidelberg 2007.",
isbn = "9783540742715",
issn = "0302-9743",
eissn = "1611-3349",
language = "eng",
}