Minimum constraint removal problem for line segments is NP-hard.
Bahram Sadeghi BighamPublished in: Discret. Math. Algorithms Appl. (2023)
Keyphrases
- line segments
- np hard
- minimum cost
- hough transform
- approximation algorithms
- straight line
- special case
- perspective images
- ellipse detection
- digital pictures
- scheduling problem
- constraint satisfaction problems
- straight line segments
- circular arcs
- aerial images
- intersection points
- linear constraints
- line detection
- lower bound
- min sum
- computational complexity
- vanishing points
- line correspondences
- optimal solution