Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon.
Gautam DasGiri NarasimhanPublished in: SCG (1994)
Keyphrases
- worst case
- line segments
- dynamic programming
- optimal solution
- preprocessing
- minimum length
- convex hull
- np hard
- objective function
- computational complexity
- hough transform
- matching algorithm
- learning algorithm
- search space
- line detection
- globally optimal
- exhaustive search
- iterative algorithms
- segmentation algorithm
- shortest path
- detection algorithm
- optimization algorithm
- tree structure
- k means
- data structure
- image sequences
- computer vision