scientific article; zbMATH DE number 2089209

MaRDI QIDQ3046478zbMATH OpenFDO

Authors Stephan J. Eidenbenz

Publication date 12 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2368/23680060.htm

Mathematics Subject Classification ID

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

Recommendations

• Finding minimum hidden guard sets in polygons --- tight approximability results
• Inapproximability results for guarding polygons and terrains
• scientific article; zbMATH DE number 2009908
• Inapproximability of finding maximum hidden sets on polygons and terrains
• Approximability of guarding weak visibility polygons

Cited in

(7)

• Hiding people in polygons
• A finite dominating set of cardinality \(O(k)\) and a witness set of cardinality \(O(n)\) for 1.5D terrain guarding problem
• Finding minimum hidden guard sets in polygons --- tight approximability results
• Towards optimal positioning of surveillance UGVs
• Optimal Guard Placement Problem Under L-Visibility
• Inapproximability results for guarding polygons and terrains
• Inapproximability of finding maximum hidden sets on polygons and terrains

This page was built for publication:

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