Computing homotopic shortest paths efficiently
Copyright policy )Computing homotopic shortest paths efficiently
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.
12 pages, 11 figures
Computational Geometry (cs.CG), FOS: Computer and information sciences, Control and Optimization, I.3.5, Homotopic shortest paths, algorithms, Computer Science Applications, Shortest path in a polygon, Computational Mathematics, Computational Theory and Mathematics, Numerical aspects of computer graphics, image analysis, and computational geometry, computational geometry, Computer Science - Computational Geometry, Geometry and Topology, F.2.2, I.3.5;F.2.2
Computational Geometry (cs.CG), FOS: Computer and information sciences, Control and Optimization, I.3.5, Homotopic shortest paths, algorithms, Computer Science Applications, Shortest path in a polygon, Computational Mathematics, Computational Theory and Mathematics, Numerical aspects of computer graphics, image analysis, and computational geometry, computational geometry, Computer Science - Computational Geometry, Geometry and Topology, F.2.2, I.3.5;F.2.2
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).38 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!