Orthogonal Terrain Guarding is NP-complete
- Submitting institution
-
City, University of London
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1359
- Type
- D - Journal article
- DOI
-
-
- Title of journal
- Journal of Computational Geometry
- Article number
- -
- First page
- 21
- Volume
- 10
- Issue
- 2
- ISSN
- 1920-180X
- Open access status
- Compliant
- Month of publication
- August
- Year of publication
- 2019
- URL
-
https://jocg.org/index.php/jocg/article/view/3086
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The paper settles an 8-year long open question on the complexity of a special case of the well-known problem of 1.5-dimensional terrain guarding and also improved an ETH lower bound given from other authors in SoCG 17. Funded by an EPSRC First Grant (EP/N029143/1, FptGeom), it has been presented at the Annual Symposium on Computational Geometry (SoCG) 2018 (A CORE - “flagship conference, a leading venue in a discipline area”) - 35% acceptance rate, and it has been invited to and published in the special issue of Journal of Computational Geometry on SoCG 2018.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
