Finding an approximate minimum-link visibility path inside a simple polygon
From MaRDI portal
Publication:672401
DOI10.1016/0020-0190(95)00072-KzbMath1022.68624MaRDI QIDQ672401
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
computational geometry; approximation algorithms; simple polygon; minimum link path; visibility path
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Cites Work
- Analysis of Christofides' heuristic: some paths are more difficult than cycles
- Computing minimum length paths of a given homotopy class
- Minimal link visibility paths inside a simple polygon
- A linear time algorithm for minimum link paths inside a simple polygon
- Minimum Cuts for Circular-Arc Graphs
- An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
- Computing the visibility polygon from a convex set and related problems