277 search results - page 3 / 56 » New results on shortest paths in three dimensions |
IROS
2006
IEEE
14 years 8 days ago
2006
IEEE
— We present an interpolation-based planning and replanning algorithm that is able to produce direct, lowcost paths through three-dimensional environments. Our algorithm builds u...
GD
2005
Springer
13 years 11 months ago
2005
Springer
This paper presents a new framework for drawing graphs in three dimensions. In general, the new framework uses a divide and conquer approach. More specifically, the framework divi...
ICIP
2004
IEEE
14 years 7 months ago
2004
IEEE
We present a new semi-automatic segmentation tool, which is motivated by the Intelligent Scissors algorithm [1], but which uses a modified concept of user-interaction. This new in...
DC
2002
13 years 6 months ago
2002
A new general theory about restoration of network paths is first introduced. The theory pertains to restoration of shortest paths in a network following failure, e.g., we prove th...
STOC
2003
ACM
14 years 6 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...