No steiner point subdivision simplification is NP-complete.
Regina EstkowskiPublished in: CCCG (1998)
Keyphrases
- np complete
- randomly generated
- multiresolution
- control points
- satisfiability problem
- np hard
- polynomially solvable
- constraint satisfaction problems
- sample points
- conjunctive queries
- polynomial time complexity
- computational complexity
- phase transition
- preprocessing
- convex hull
- integrity constraints
- pspace complete
- data model
- conp complete