Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon
From MaRDI portal
Publication:4881404
DOI10.1006/JAGM.1996.0023zbMATH Open0845.68108OpenAlexW1989541681MaRDI QIDQ4881404FDOQ4881404
Authors: Danny Z. Chen 
Publication date: 9 June 1996
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1949&context=cstech
Recommendations
- Determining Weak Visibility of a Polygon from an Edge in Parallel
- Optimally computing a shortest weakly visible line segment inside a simple polygon
- AN OPTIMAL PARALLEL ALGORITHM FOR DETECTING WEAK VISIBILITY OF A SIMPLE POLYGON
- COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON
Cited In (8)
- Determining Weak Visibility of a Polygon from an Edge in Parallel
- COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON
- Optimally computing a shortest weakly visible line segment inside a simple polygon
- Efficient edge-skeleton computation for polytopes defined by oracles
- Finding the shortest boundary guard of a simple polygon
- Guarding in a simple polygon
- Open guard edges and edge guards in simple polygons
- LR-visibility in polygons
This page was built for publication: Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4881404)
