An optimal O(nlogn) algorithm for finding an enclosing planar rectilinear annulus of minimum width.
Olga GluchshenkoHorst W. HamacherArie TamirPublished in: Oper. Res. Lett. (2009)
Keyphrases
- dynamic programming
- optimal solution
- detection algorithm
- worst case
- objective function
- search space
- matching algorithm
- optimization algorithm
- minimum length
- exhaustive search
- preprocessing
- k means
- times faster
- energy function
- image segmentation
- simulated annealing
- computational cost
- experimental evaluation
- cost function
- linear programming
- particle swarm optimization
- expectation maximization
- graph cuts
- segmentation algorithm
- probabilistic model
- convergence rate
- computational complexity
- spanning tree
- constant factor
- learning algorithm