Finding the Minimum Number of Open-Edge Guards in an Orthogonal Polygon is NP-Hard
| Autor: | Chuzo Iwamoto |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Discrete mathematics
Polygon covering Art gallery problem Computer science 0211 other engineering and technologies 021107 urban & regional planning 0102 computer and information sciences 02 engineering and technology Edge (geometry) 01 natural sciences Combinatorics 010201 computation theory & mathematics Artificial Intelligence Hardware and Architecture Polygon Computer Vision and Pattern Recognition Visibility polygon Electrical and Electronic Engineering Software |
| Zdroj: | IEICE Transactions on Information and Systems. :1521-1525 |
| ISSN: | 1745-1361 0916-8532 |
| DOI: | 10.1587/transinf.2016edl8251 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|