Finding an approximate minimum-link visibility path inside a simple polygon
From MaRDI portal
Recommendations
Cites work
- A linear time algorithm for minimum link paths inside a simple polygon
- An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
- Analysis of Christofides' heuristic: some paths are more difficult than cycles
- Computing minimum length paths of a given homotopy class
- Computing the visibility polygon from a convex set and related problems
- Minimal link visibility paths inside a simple polygon
- Minimum Cuts for Circular-Arc Graphs
Cited in
(9)- Minimum-link watchman tours
- Approximation algorithms for the watchman route and zookeeper's problems.
- Fast computation of shortest watchman routes in simple polygons
- Minimal link visibility paths inside a simple polygon
- A linear-time 2-approximation algorithm for the watchman route problem for simple polygons
- MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS
- scientific article; zbMATH DE number 1256695 (Why is no real title available?)
- Single-Point Visibility Constraint Minimum Link Paths in 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)