Homotopic \(\mathcal{C}\)-oriented routing with few links and thick edges

DOI10.1016/j.comgeo.2017.10.005zbMath1384.90017OpenAlexW2761432749WikidataQ59782224 ScholiaQ59782224MaRDI QIDQ1693321

Kevin Verbeek, Bettina Speckmann

Publication date: 12 February 2018

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2017.10.005

zbMATH Keywords

routinghomotopic\(\mathcal{C}\)-orientedminimum-linkthick paths

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (3)

Minimum-link \(C\)-oriented paths visiting a sequence of regions in the plane ⋮ Shortcut hulls: vertex-restricted outer simplifications of polygons ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Computing minimum length paths of a given homotopy class
• Testing homotopy for paths in the plane
• Schematization of networks
• Computing homotopic shortest paths efficiently
• Constructing pairwise disjoint paths with few links
• Path Simplification for Metro Map Layout
• Thick non-crossing paths and minimum-cost flows in polygonal domains
• Planar Formulae and Their Uses
• Computing homotopic shortest paths in the plane
• DRAWING WITH FAT EDGES

This page was built for publication: Homotopic \(\mathcal{C}\)-oriented routing with few links and thick edges