Sciweavers

Share
ICCSA
2007
Springer

Shortest Path Queries Between Geometric Objects on Surfaces

9 years 5 months ago
Shortest Path Queries Between Geometric Objects on Surfaces
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, edges, segments, faces, chains, regions and sets of these. The surface P consists of n positively weighted triangular faces. The cost of a path on P is the weighted sum of Euclidean lengths of the sub-paths within each face of P. We present generic algorithms which provide approximate solutions.
Hua Guo, Anil Maheshwari, Doron Nussbaum, Jör
Added 08 Jun 2010
Updated 08 Jun 2010
Type Conference
Year 2007
Where ICCSA
Authors Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack
Comments (0)
books