Minimum-link \(C\)-oriented paths visiting a sequence of regions in the plane

DOI10.1007/978-3-031-30448-4_18arXiv2302.06776MaRDI QIDQ6057337

Matthew J. Katz, Joseph S. B. Mitchell, Kerem Geva, Eli Packer

Publication date: 4 October 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2302.06776

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Ordered stabbing of pairwise disjoint convex sets in linear time
• Homotopic \(\mathcal{C}\)-oriented routing with few links and thick edges
• Minimum-link paths revisited
• EXISTENCE AND COMPUTATION OF TOURS THROUGH IMPRECISE POINTS
• Touring a sequence of polygons
• APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS

This page was built for publication: Minimum-link \(C\)-oriented paths visiting a sequence of regions in the plane