Computing Homotopic Shortest Paths Efficiently
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
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.
Create a lesson
Related papers
Geometric Bin Packing Beyond Convexity: Approximation Schemes without Augmentation
Lucas de Oliveira Silva, Elisa Dell'Arriva, Flávio Keidi Miyazawa
Polyominoes Folding into Four and Five Distinct Boxes
Erik D. Demaine, Toshihiro Shirakawa, Conner Silverstein et al.
Quadratic Reconfiguration of Plane Spanning Paths on Two-Layer Point Sets
Samuel Avril, Yan Gerard, Guilherme D. da Fonseca
From Static Models to Editable CAD: A Design-Intent-Aware Framework for Reverse Parametrization
Yurim Lee, Sumin Lee, Namwoo Kang
Representation-Aware Closed-Surface Parameterization: Exact Sensitivity Analysis and Pole-Aware Planar Preconditioning
Zixi Yi, Gary P. T. Choi
Hamiltonian Cycle Construction in Rectangular Grid Graphs with Three-Stacked Triangular Holes
Cecilia Chen, Dianna Xu