Allocating vertex -guards in simple polygons via pseudo-triangulations

DOI10.1007/S00454-004-1091-9zbMATH Open1079.52504OpenAlexW3137242876WikidataQ59782404 ScholiaQ59782404MaRDI QIDQ1772125FDOQ1772125

Authors: Bettina Speckmann, Csaba D. Tóth 

Publication date: 15 April 2005

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-004-1091-9

Recommendations

• scientific article; zbMATH DE number 2079328
• \(K\)-vertex guarding simple polygons
• Guarding curvilinear art galleries with vertex or point guards
• Polygon guarding with orientation
• GUARDING A POLYGON FROM TWO NEARLY-OPPOSITE DIRECTIONS

zbMATH Keywords

visibilityart-gallery problemguard

Mathematics Subject Classification ID

Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)

Cited In (14)

• Improved bounds for wireless localization
• Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
• On the complexity of half-guarding monotone polygons
• Geodesic-preserving polygon simplification
• Continuous surveillance of points by rotating floodlights
• Title not available (Why is that?)
• Floodlight illumination of infinite wedges
• Pointed binary encompassing trees: simple and optimal
• Towards optimal positioning of surveillance UGVs
• Improved Bounds for Wireless Localization
• On the number of pseudo-triangulations of certain point sets
• Traditional Galleries Require Fewer Watchmen
• Resolving Loads with Positive Interior Stresses
• Decomposing a simple polygon into pseudo-triangles and convex polygons

This page was built for publication: Allocating vertex \(\pi\)-guards in simple polygons via pseudo-triangulations

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