Approximate Shortest Path through a Weighted Planar Subdivision

Details Approximate Shortest Path through a Weighted Planar Subdivision Approximate Shortest Path through a Weighted Planar Subdivision

2010-11-30

arxiv.org/abs/1011.6498v1

Computer Science

Computational Geometry

Scientific paper

This paper presents an approximation algorithm for finding a shortest path between two points $s$ and $t$ in a weighted planar subdivision $\PS$. Each face $f$ of $\PS$ is associated with a weight $w_f$, and the cost of travel along a line segment on $f$ is $w_f$ multiplied by the Euclidean norm of that line segment. The cost of a path which traverses across several faces of the subdivision is the sum of the costs of travel along each face. Our algorithm progreeses the discretized shortest path wavefront from source $s$, and takes polynomial time in finding an $\epsilon$-approximate shortest path.

Affiliated with

Also associated with

No associations

Rating

Approximate Shortest Path through a Weighted Planar Subdivision does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approximate Shortest Path through a Weighted Planar Subdivision, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximate Shortest Path through a Weighted Planar Subdivision will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-445138