Planar Steiner Orientation is NP-complete.
Moritz BeckJohannes BlumMyroslav KryvenAndre LöfflerJohannes ZinkPublished in: CoRR (2018)
Keyphrases
- np complete
- np hard
- randomly generated
- satisfiability problem
- computational complexity
- constraint satisfaction problems
- conjunctive queries
- polynomial time complexity
- geometrical properties
- np complete problems
- surface patches
- data complexity
- pspace complete
- steiner tree
- position and orientation
- single point
- projective geometry
- ground plane
- line drawings
- orientation estimation
- phase transition
- branch and bound algorithm
- parallel manipulator
- image sequences