Approximate Point-to-Face Shortest Paths in R^3

Details Approximate Point-to-Face Shortest Paths in R^3 Approximate Point-to-Face Shortest Paths in R^3

2010-04-09

arxiv.org/abs/1004.1588v1

Computer Science

Computational Geometry

16 pages, Latex

Scientific paper

We address the point-to-face approximate shortest path problem in R: Given a set of polyhedral obstacles with a total of n vertices, a source point s, an obstacle face f, and a real positive parameter epsilon, compute a path from s to f that avoids the interior of the obstacles and has length at most (1+epsilon) times the length of the shortest obstacle avoiding path from s to f. We present three approximation algorithms that take by extending three well-known "point-to-point" shortest path algorithms.

Affiliated with

Also associated with

No associations

Rating

Approximate Point-to-Face Shortest Paths in R^3 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 Point-to-Face Shortest Paths in R^3, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximate Point-to-Face Shortest Paths in R^3 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-221490