Constructing pairwise disjoint paths with few links

DOI10.1007/3-540-63307-3_79zbMath1497.68530OpenAlexW1773930987MaRDI QIDQ5096957

Himanshu Gupta, Rephael Wenger

Publication date: 19 August 2022

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

Full work available at URL: https://doi.org/10.1007/3-540-63307-3_79

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cites Work

• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Triangulating a simple polygon in linear time
• On compatible triangulations of simple polygons
• A linear time algorithm for minimum link paths inside a simple polygon
• Constructing Piecewise Linear Homeomorphisms of Simple Polygons
• Constructing pairwise disjoint paths with few links
• APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
• ISOMORPHIC TRIANGULATIONS WITH SMALL NUMBER OF STEINER POINTS