Computing Homotopic Shortest Paths Efficiently
classification
💻 cs.CG
keywords
pathshomotopicshortestaddressesalgorithmamongstcomputingdisjoint
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.