Computing Homotopic Shortest Paths Efficiently
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
TL;DR
This paper introduces a more efficient algorithm for computing shortest paths that are homotopic to given disjoint paths navigating around point obstacles in the plane.
Contribution
It presents a faster algorithm for homotopic shortest path computation compared to previous methods.
Findings
Algorithm is faster than prior solutions.
Successfully computes homotopic shortest paths.
Applicable to paths around point obstacles.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Computational Geometry and Mesh Generation · Topological and Geometric Data Analysis