Thick non-crossing paths and minimum-cost flows in polygonal domains
From MaRDI portal
Publication:3602854
DOI10.1145/1247069.1247079zbMath1221.68277OpenAlexW2115001291MaRDI QIDQ3602854
Joseph S. B. Mitchell, Valentin Polishchuk
Publication date: 12 February 2009
Published in: Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1247069.1247079
Deterministic network models in operations research (90B10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (8)
Non-crossing shortest paths lengths in planar graphs in linear time ⋮ Non-crossing shortest paths lengths in planar graphs in linear time ⋮ Homotopic \(\mathcal{C}\)-oriented routing with few links and thick edges ⋮ Routing multi-class traffic flows in the plane ⋮ Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths ⋮ Maximum thick paths in static and dynamic environments ⋮ Exact solution algorithms for the maximum flow problem with additional conflict constraints ⋮ Thick non-crossing paths in a polygonal domain
This page was built for publication: Thick non-crossing paths and minimum-cost flows in polygonal domains