Computing Homotopic Shortest Paths Efficiently

Details Computing Homotopic Shortest Paths Efficiently Computing Homotopic Shortest Paths Efficiently

2002-04-25

arxiv.org/abs/cs/0204050v1

Computer Science

Computational Geometry

12 pages, 11 figures

Scientific paper

This paper addresses the problem of finding shortest paths homotopic to a
given disjoint set of paths that wind amongst point obstacles in the plane. We
present a faster algorithm than previously known.

Affiliated with

Also associated with

No associations

Rating

Computing Homotopic Shortest Paths Efficiently 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 Computing Homotopic Shortest Paths Efficiently, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing Homotopic Shortest Paths Efficiently will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-397253