Optimum placement of guards

DOI10.1016/0020-0255(94)90072-8MaRDI QIDQ1328566zbMATH OpenOpenAlexFDO

Authors Markos Tsoukalas, Simeon C. Ntafos

Publication date 27 September 1994

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0255(94)90072-8

zbMATH Keywords

computational geometryplacing guards

Mathematics Subject Classification ID

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

Recommendations

• An efficient algorithm for guard placement in polygons with holes
• Inapproximability results for guarding polygons and terrains
• scientific article; zbMATH DE number 4060719
• scientific article; zbMATH DE number 4062605
• Locating guards for visibility coverage of polygons

Cites work

• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A linear algorithm for computing the visibility polygon from a point
• Computational complexity of art gallery problems
• Path Planning in 0/1/∞ Weighted Regions with Applications
• Sequential and parallel complexity of approximate evaluation of polynomial zeros

Cited in

(9)

• A randomized art-gallery algorithm for sensor placement
• scientific article; zbMATH DE number 4062605 (Why is no real title available?)
• scientific article; zbMATH DE number 6469255 (Why is no real title available?)
• Finding a guard that sees most and a shop that sells most
• Maximizing the guarded boundary of an Art Gallery is APX-complete
• Guard placement for maximizing L-visibility exterior to a convex polygon
• Locating guards for visibility coverage of polygons
• Locating guards for visibility coverage of polygons
• An efficient algorithm for guard placement in polygons with holes

This page was built for publication: Optimum placement of guards

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