Allocating vertex \(\pi\)-guards in simple polygons via pseudo-triangulations
From MaRDI portal
Publication:1772125
DOI10.1007/s00454-004-1091-9zbMath1079.52504OpenAlexW3137242876WikidataQ59782404 ScholiaQ59782404MaRDI QIDQ1772125
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
Related Items
Resolving Loads with Positive Interior Stresses, On the complexity of half-guarding monotone polygons, Guarding Art Galleries: The Extra Cost for Sculptures Is Linear, Improved Bounds for Wireless Localization, Decomposing a simple polygon into pseudo-triangles and convex polygons, On the number of pseudo-triangulations of certain point sets, Improved bounds for wireless localization, Towards Optimal Positioning of Surveillance UGVs, Floodlight illumination of infinite wedges, Pointed binary encompassing trees: simple and optimal, CONTINUOUS SURVEILLANCE OF POINTS BY ROTATING FLOODLIGHTS, GEODESIC-PRESERVING POLYGON SIMPLIFICATION
