Sciweavers

Share
CAIP
2007
Springer

Euclidean Shortest Paths in Simple Cube Curves at a Glance

9 years 6 months ago
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 ()
Fajie Li, Reinhard Klette
Added 12 Aug 2010
Updated 12 Aug 2010
Type Conference
Year 2007
Where CAIP
Authors Fajie Li, Reinhard Klette
Comments (0)
books