Orthogonal Terrain Guarding is NP-complete.
Édouard BonnetPanos GiannopoulosPublished in: J. Comput. Geom. (2019)
Keyphrases
- np complete
- constraint satisfaction problems
- satisfiability problem
- np hard
- three dimensional
- randomly generated
- computational complexity
- multiresolution
- pspace complete
- terrain modeling
- data complexity
- np complete problems
- conjunctive queries
- polynomially solvable
- rough terrain
- polynomial time complexity
- phase transition
- bounded treewidth
- legged robots
- special case
- data sets