Minimising line segments in linear diagrams is NP-hard.
Peter ChapmanKevin SimHuang Hao ChenPublished in: J. Comput. Lang. (2022)
Keyphrases
- edge detection
- line segments
- np hard
- hough transform
- linear features
- line detection
- digital pictures
- straight line
- circular arcs
- lower bound
- scheduling problem
- straight line segments
- ellipse detection
- computational complexity
- optimal solution
- intersection points
- perspective images
- special case
- epipolar geometry
- shape model
- three dimensional