Orthogonal Terrain Guarding is NP-complete.
Édouard BonnetPanos GiannopoulosPublished in: CoRR (2017)
Keyphrases
- np complete
- np hard
- randomly generated
- constraint satisfaction problems
- three dimensional
- satisfiability problem
- computational complexity
- multiresolution
- conjunctive queries
- rough terrain
- terrain modeling
- polynomial time complexity
- data complexity
- pspace complete
- bounded treewidth
- phase transition
- polynomially solvable
- database
- orthogonal polynomials
- digital elevation models
- np complete problems
- data integration