Finding the shortest boundary guard of a simple polygon

DOI10.1016/S0304-3975(00)00235-8zbMATH Open0973.68241OpenAlexW2132466471MaRDI QIDQ5941506FDOQ5941506

Authors: B.-K. Lu, F. R. Hsu, 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

Recommendations

• Finding the shortest watchman route in a simple polygon
• AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES
• Guarding in a simple polygon
• Shortest watchman routes in simple polygons
• scientific article; zbMATH DE number 2081014

zbMATH Keywords

boundary guard

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Title not available (Why is that?)
• A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
• Ray shooting in polygons using geodesic triangulations
• An Optimal Algorithm for Finding the Kernel of a Polygon
• Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon
• An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
• An optimal algorithm for detecting weak visibility of a polygon
• Title not available (Why is that?)
• EFFICIENT ALGORITHMS FOR SOLVING DIAGONAL VISIBILITY PROBLEMS IN A SIMPLE POLYGON

Cited In (3)

• Guarding Exterior Region of a Simple Polygon
• Guarding in a simple polygon
• Open guard edges and edge guards in simple polygons

This page was built for publication: Finding the shortest boundary guard of a simple polygon

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941506)