2 search results - page 1 / 1 » Euclidean Shortest Paths in Simple Cube Curves at a Glance |
87
Voted
CAIP
2007
Springer
15 years 2 months ago
2007
Springer
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 a...
LATIN
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. Automatic graph drawers need to compute paths among vertices of a simple polygon which besides remaining in the interior need to exhibit certain aesthetic properties. Som...