115 search results - page 3 / 23 » Approximation Algorithms for Shortest Descending Paths in Te... |
134
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
152
click to vote
COMPGEOM
2000
ACM
15 years 8 months ago
2000
ACM
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
159
Voted
DAM
2000
15 years 3 months ago
2000
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to
186
click to vote
DCG
2010
15 years 4 months ago
2010
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
129
click to vote
SIAMCOMP
2010
15 years 2 months ago
2010
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...