The Straight-Line RAC Drawing Problem is NP-Hard.
Evmorfia N. ArgyriouMichael A. BekosAntonios SymvonisPublished in: J. Graph Algorithms Appl. (2012)
Keyphrases
- straight line
- np hard
- hough transform
- line detection
- approximation algorithms
- optimal solution
- np complete
- special case
- line segments
- scheduling problem
- high availability
- line drawings
- curvature estimation
- lower bound
- vanishing points
- greedy heuristic
- oracle database
- computational complexity
- linear programming
- radon transform
- feature points
- computer vision
- digital straight line
- high quality
- database administrators
- distributed databases
- feature selection