Euclidean Shortest Paths in Simple Cube Curves at a Glance
| dc.creator | Li, Fajie | |
| dc.creator | Klette, Reinhard | |
| dc.date | 2007-04-24 | |
| dc.date.accessioned | 2026-07-07T07:59:02Z | |
| dc.date.available | 2026-07-07T07:59:02Z | |
| dc.description | 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 $κ(ε) \cdot {\cal O}(n)$, where $κ(ε)$ 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. | |
| dc.description | 8 pages | |
| dc.identifier | https://arxiv.org/abs/0704.3197 | |
| dc.identifier | http://arxiv.org/abs/0704.3197 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/128223 | |
| dc.subject | Computational Geometry | |
| dc.subject | Discrete Mathematics | |
| dc.subject | F.2.2; G.2.2 | |
| dc.title | Euclidean Shortest Paths in Simple Cube Curves at a Glance | |
| dc.type | text |