Finding the shortest boundary guard of a simple polygon
From MaRDI portal
Publication:5941506
DOI10.1016/S0304-3975(00)00235-8zbMath0973.68241OpenAlexW2132466471MaRDI QIDQ5941506
Fang-Rong Hsu, Bor-Kuan Lu, Chuan Yi Tang
Publication date: 20 August 2001
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00235-8
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Ray shooting in polygons using geodesic triangulations
- An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
- An Optimal Algorithm for Finding the Kernel of a Polygon
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
- EFFICIENT ALGORITHMS FOR SOLVING DIAGONAL VISIBILITY PROBLEMS IN A SIMPLE POLYGON
- Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon
- An optimal algorithm for detecting weak visibility of a polygon
This page was built for publication: Finding the shortest boundary guard of a simple polygon