Euclidean Shortest Paths in Simple Cube Curves at a Glance

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 ()

• Type: Conference
• Year: 2007
• Where: CAIP
• Authors: Fajie Li, Reinhard Klette
• Keywords: CAIP 2007, Correct Approximate Algorithms, Euclidean Shortest Path, Image Analysis, Implemented Esp Algorithm