An Optimal Algorithm Computing Edge-to-Edge Visibility in a Simple Polygon.
Mikkel AbrahamsenPublished in: CCCG (2013)
Keyphrases
- dynamic programming
- optimal solution
- simple polygon
- worst case
- learning algorithm
- matching algorithm
- np hard
- computational complexity
- data sets
- computationally efficient
- high dimensional
- probabilistic model
- convex hull
- lower bound
- edge detection
- natural images
- feature space
- frequency domain
- object recognition
- image processing