108 search results - page 15 / 22 » Constant-Work-Space Algorithm for a Shortest Path in a Simpl... |
WADS
2005
Springer
14 years 1 months ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
ICRA
2003
IEEE
14 years 29 days ago
2003
IEEE
— We present an O(n log1+ε n)-time algorithm for computing the optimal robot motion that maintains lineof-sight visibility between a target moving inside a polygon with n vertic...
TON
2008
13 years 7 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
— A central problem of applications dealing with virtual environments is planning a collision-free path for a character. Since environments and their characters are growing more ...
TON
2002
13 years 7 months ago
2002
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...