Finding an approximate minimum-link visibility path inside a simple polygon
From MaRDI portal
Publication:672401
DOI10.1016/0020-0190(95)00072-KzbMATH Open1022.68624OpenAlexW1997350911MaRDI QIDQ672401FDOQ672401
Authors: Juan-Miguel Gracia 
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(95)00072-k
Recommendations
Cites Work
- Computing the visibility polygon from a convex set and related problems
- A linear time algorithm for minimum link paths inside a simple polygon
- Analysis of Christofides' heuristic: some paths are more difficult than cycles
- An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
- Computing minimum length paths of a given homotopy class
- Minimal link visibility paths inside a simple polygon
- Minimum Cuts for Circular-Arc Graphs
Cited In (7)
- Minimum-link watchman tours
- Fast computation of shortest watchman routes in simple polygons
- Approximation algorithms for the watchman route and zookeeper's problems.
- Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons
- MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS
- A linear-time 2-approximation algorithm for the watchman route problem for simple polygons
- Finding a shortest Hamiltonian path inside a simple polygon
This page was built for publication: Finding an approximate minimum-link visibility path inside a simple polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672401)
