Optimum placement of guards

DOI10.1016/0020-0255(94)90072-8zbMath0810.68117OpenAlexW2046674185MaRDI QIDQ1328566

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)

Related Items (1)

Maximizing the guarded boundary of an Art Gallery is APX-complete

Cites Work

• Unnamed Item
• Unnamed Item
• Sequential and parallel complexity of approximate evaluation of polynomial zeros
• Computational complexity of art gallery problems
• A linear algorithm for computing the visibility polygon from a point
• Path Planning in 0/1/∞ Weighted Regions with Applications

This page was built for publication: Optimum placement of guards