An algorithm for polygon placement using a bottom-left strategy.
Kathryn A. DowslandSubodh VaidWilliam B. DowslandPublished in: Eur. J. Oper. Res. (2002)
Keyphrases
- learning algorithm
- times faster
- convex hull
- optimization algorithm
- k means
- objective function
- computationally efficient
- np hard
- search strategy
- experimental evaluation
- high accuracy
- matching algorithm
- clustering method
- theoretical analysis
- particle swarm optimization
- linear programming
- convergence rate
- recognition algorithm
- computational complexity
- improved algorithm
- selection algorithm
- monte carlo
- single pass
- detection algorithm
- simulated annealing
- least squares
- data points
- probabilistic model
- dynamic programming
- significant improvement
- preprocessing
- data structure
- similarity measure