Optimal Guard Placement Problem Under L-Visibility

DOI10.1007/11751540_2MaRDI QIDQ5505310zbMATH OpenOpenAlexFDO

Authors Debabrata Bardhan, Sasanka Roy, Sandip Das

Publication date 27 January 2009

Published in Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11751540_2

Mathematics Subject Classification ID

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

Recommendations

• Guard placement for maximizing L-visibility exterior to a convex polygon
• The guarding problem -- complexity and approximation
• AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
• scientific article; zbMATH DE number 969102
• Optimal guard sets and the Helly property
• A constant-factor approximation algorithm for optimal terrain guarding
• The continuous 1.5D terrain guarding problem: discretization, optimal solutions, and PTAS
• Approximability of guarding weak visibility polygons
• scientific article; zbMATH DE number 2089209

Cited in

(5)

• scientific article; zbMATH DE number 5799963 (Why is no real title available?)
• Guard placement for maximizing L-visibility exterior to a convex polygon
• scientific article; zbMATH DE number 1208727 (Why is no real title available?)
• Guarding Exterior Region of a Simple Polygon
• scientific article; zbMATH DE number 6469255 (Why is no real title available?)

This page was built for publication: Optimal Guard Placement Problem Under L-Visibility

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