Finding the Minimum Number of Face Guards is NP-Hard

Chuzo IWAMOTO; Yusuke KITAGAKI; Kenichi MORITA

doi:10.1587/transinf.E95.D.2716

IEICE Transactions on Information and Systems

Online ISSN : 1745-1361
Print ISSN : 0916-8532

Regular Section

Finding the Minimum Number of Face Guards is NP-Hard

Chuzo IWAMOTO, Yusuke KITAGAKI, Kenichi MORITA

Author information

Keywords: face guards, polyhedral terrains, NP-hard

JOURNAL FREE ACCESS

2012 Volume E95.D Issue 11 Pages 2716-2719

DOI https://doi.org/10.1587/transinf.E95.D.2716

Details

Abstract

We study the complexity of finding the minimum number of face guards which can observe the whole surface of a polyhedral terrain. Here, a face guard is allowed to be placed on the faces of a terrain, and the guard can walk around on the allocated face. It is shown that finding the minimum number of face guards is NP-hard.

Content from these authors

Favorites & Alerts

Corresponding author

Register with J-STAGE for free!