The Straight-Line RAC Drawing Problem Is NP-Hard.
Evmorfia N. ArgyriouMichael A. BekosAntonios SymvonisPublished in: SOFSEM (2011)
Keyphrases
- straight line
- np hard
- hough transform
- scheduling problem
- curvature estimation
- approximation algorithms
- linear programming
- line detection
- feature points
- line segments
- lower bound
- np complete
- computational complexity
- high availability
- worst case
- optimal solution
- oracle database
- line drawings
- greedy heuristic
- special case
- radon transform
- intersection points
- database administrators
- straight line segments
- three dimensional
- image processing