Orthogonal Terrain Guarding is NP-complete.
Édouard BonnetPanos GiannopoulosPublished in: SoCG (2018)
Keyphrases
- np complete
- satisfiability problem
- randomly generated
- np hard
- three dimensional
- pspace complete
- multiresolution
- computational complexity
- conjunctive queries
- polynomially solvable
- rough terrain
- terrain modeling
- constraint satisfaction problems
- bounded treewidth
- conp complete
- polynomial time complexity
- description logics
- mobile robot
- phase transition
- outdoor environments
- real time
- orthogonal projection