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