Name
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-74472-6_7 | ICCSA (1) |
Keywords | Field | DocType |
geometric object,approximate solution,weighted triangular,geometric shortest path query,genus g,euclidean length,weighted sum,surface p,arbitrary pair,connected polyhedral surface p,shortest path query,generic algorithm,shortest path | Discrete mathematics,Combinatorics,Vertex (geometry),Shortest path problem,Steiner point,Distance,Yen's algorithm,Shortest Path Faster Algorithm,Mathematics,K shortest path routing,Euclidean shortest path | Conference |
Volume | ISSN | ISBN |
4705 | 0302-9743 | 3-540-74468-1 |
Citations | PageRank | References |
1 | 0.39 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hua Guo | 1 | 10 | 1.27 |
| Anil Maheshwari | 2 | 869 | 104.47 |
| Doron Nussbaum | 3 | 89 | 13.49 |
| Jörg-Rüdiger Sack | 4 | 1099 | 166.07 |