An Efficient Algorithm to Calculate the Center of the Biggest Inscribed Circle in an Irregular Polygon
Oscar MartinezPublished in: CoRR (2012)
Keyphrases
- dynamic programming
- computational complexity
- simulated annealing
- improved algorithm
- experimental evaluation
- computationally efficient
- detection algorithm
- high accuracy
- worst case
- convergence rate
- single pass
- preprocessing
- objective function
- recognition algorithm
- image processing
- estimation algorithm
- optimization algorithm
- memory efficient
- expectation maximization
- probabilistic model
- computational cost
- theoretical analysis
- input data
- tree structure
- matching algorithm
- times faster
- convex hull
- np hard
- cost function
- k means
- feature selection