Lyudmil Aleksandrov, Mark Lanthier, Anil Maheshwari, Jörg-R. Sack  Home/Search
Context Related
| scs.carleton.ca/~lanthier/p...swat98.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: scs.carleton.ca/~lanthier/pe...cv (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Let P be a simple polyhedron, possibly non-convex, whose boundary is composed of n triangular faces, and in which each face has an associated positive weight. The cost of travel through each face is the distance traveled multiplied by the face's weight. We present an ffl- approximation algorithm for computing a weighted shortest path on P, i.e. the ratio of the length of the computed path with respect to the length of an optimal path is bounded by (1 + ffl), for a given ffl ? 0.We give... (Update)
Similar documents based on text: More All
0.5: An ε-Approximation Algorithm for Weighted.. - Aleksandrov.. (1998) (Correct)
0.5: Approximating Shortest Paths on Weighted Polyhedral Surfaces - Lanthier, Maheshwari, Sack (Correct)
0.3: Parallel Algorithms in External Memory - Hutchinson (2000) (Correct)
Related documents from co-citation: More All
5: A new algorithm for computing shortest paths in weighted planar subdivisions - Mata, Mitchell - 1997
5: The weighted region problem: finding shortest paths through a weighted planar su.. (context) - Mitchell, Papadimitriou - 1991
5: Approximation algorithms for geometric shortest path problems (context) - Aleksandrov, Maheshwari et al. - 2000
BibTeX entry: (Update)
L. Aleksandrov, M. Lanthier, A. Maheshwari, and J.R. Sack, An -approximation algorithm for weighted shortest paths on polyhedral surfaces, Proceedings of the 6 th Scandinavian Workshop on Algorithm Theory, SWAT'98, Stockholm, LNCS 1432, (1998), pp. 11-22. http://citeseer.ist.psu.edu/aleksandrov98epsilonapproximation.html More
@inproceedings{ aleksandrov98epsilonapproximation,
author = "Lyudmil Aleksandrov and Mark Lanthier and Anil Maheshwari and Jdiger Sack",
title = "An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces",
booktitle = "Scandinavian Workshop on Algorithm Theory",
pages = "11-22",
year = "1998",
url = "citeseer.ist.psu.edu/aleksandrov98epsilonapproximation.html" }
Citations (may not include all citations):353 Fibonacci Heaps and Their Uses in Improved Network Optimizat.. (context) - Fredman, Tarjan - 1987
50 On Shortest Paths in Polyhedral Spaces (context) - Sharir, Schorr - 1986
41 An Algorithm for Shortest Path Motion in Three Dimensions (context) - Papadimitriou - 1985
31 The Weighted Region Problem: Finding Shortest Paths Through .. (context) - Mitchell, Papadimitriou - 1991
28 Approximating Weighted Shortest Paths on Polyhedral Surfaces - Lanthier, Maheshwari et al. - 1997
22 CRC Press LLC (context) - Goodman, O'Rourke et al. - 1997
19 Handbook on Computational Geometry (context) - Sack, Eds
18 A New Algorithm for Computing Shortest Paths in Weighted Pla.. - Mata, Mitchell - 1997
11 An ffl-Approximation Algorithm for Weighted Shortest Path Qu.. (context) - Aleksandrov, Lanthier et al. - 1998
4 Approximate Euclidean Shortest Path in 3Space (context) - Choi, Sellen et al. - 1994
3 Shortest Path Problems on Polyhedral Surfaces (context) - Lanthier - 1998
2 How To Take Short Cuts (context) - Kenyon, Kenyon - 1992
2 School of Computer Science (context) - Webpage
2 a Weighted Distance Model for Injection Molding (context) - Johansson - 1997
2 Short Cuts in Higher Dimensional Space (context) - Das, Narasimhan - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.scs.carleton.ca/~lanthier/personal/cv/cv.html): More
Towards the Design of Smaller Artificially Living Robots - Lanthier, Oppacher (Correct)
An ε-Approximation Algorithm for Weighted.. - Aleksandrov.. (1998) (Correct)
Shortest Anisotropic Paths on Terrains - Lanthier, Maheshwari, Sack (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC