Minimum Constraint Removal Problem for Line Segments is NP-hard.
Bahram Sadeghi BighamPublished in: CoRR (2021)
Keyphrases
- line segments
- np hard
- minimum cost
- hough transform
- straight line
- approximation algorithms
- lower bound
- ellipse detection
- digital pictures
- scheduling problem
- optimal solution
- special case
- aerial images
- line detection
- edge pixels
- straight line segments
- perspective images
- constraint satisfaction problems
- linear constraints
- circular arcs
- linear programming
- line correspondences
- intersection points
- image processing
- geometric primitives
- computational complexity