12 search results - page 1 / 3 » Approximating geometric bottleneck shortest paths |
COMGEO
2004
ACM
13 years 4 months ago
2004
ACM
ICCSA
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We consider geometric shortest path queries between arbitrary pairs of objects on a connected polyhedral surface P of genus g. The query objects are points, vertices, edg...
DCG
2010
13 years 5 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...
COMPGEOM
2005
ACM
13 years 6 months ago
2005
ACM
We illustrate the Link Solver software for computing 1-link shortest paths in weighted regions. The Link Solver implements a prune-and-search method that can be used to approximat...
ALGORITHMICA
2011
12 years 12 months ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...