Sciweavers

115 search results - page 2 / 23
» Approximation Algorithms for Shortest Descending Paths in Te...
Sort
View
ISVC
2009
Springer
14 years 1 months ago
Energetic Path Finding across Massive Terrain Data
Throughout history, the primary means of transportation for humans has been on foot. We present a software tool which can help visualize and predict where historical trails might l...
Andrew Tsui, Zoë J. Wood
GIS
2010
ACM
13 years 6 months ago
Scalable shortest paths browsing on land surface
The growing popularity of online Earth visualization tools and geo-realistic games and the availability of high resolution terrain data have motivated a new class of queries to th...
Songhua Xing, Cyrus Shahabi
ICRA
2006
IEEE
115views Robotics» more  ICRA 2006»
14 years 1 months ago
Path Planning above a Polyhedral Terrain
— We consider the problem of path planning above a polyhedral terrain and present a new algorithm that for any p ≥ 1, computes a (c + ε)-approximation to the Lp-shortest path ...
Hamid Zarrabi-Zadeh
FOCS
2010
IEEE
13 years 5 months ago
Replacement Paths via Fast Matrix Multiplication
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...
Oren Weimann, Raphael Yuster
PSIVT
2007
Springer
143views Multimedia» more  PSIVT 2007»
14 years 1 months ago
Approximate ESPs on Surfaces of Polytopes Using a Rubberband Algorithm
Let p and q be two points on the surface of a polytope Π. This paper provides a rubberband algorithm for computing a Euclidean shortest path between p and q (a so-called surface E...
Fajie Li, Reinhard Klette, Xue Fu