An Optimal Algorithm for Computing a Best Cut of a Set of Hyperrectangles.
Fabrizio d'AmoreThomas RoosPeter WidmayerPublished in: ICCG (1993)
Keyphrases
- worst case
- dynamic programming
- decomposition algorithm
- optimal solution
- initial set
- high accuracy
- experimental evaluation
- detection algorithm
- particle swarm optimization
- computational cost
- solution space
- k means
- preprocessing
- exhaustive search
- objective function
- globally optimal
- optimization algorithm
- convex hull
- minimum distance
- closed form
- path planning
- lower and upper bounds
- input data
- locally optimal
- probabilistic model
- cost function
- optimality criterion
- significant improvement
- computational complexity
- learning algorithm
- input pattern
- minimum length
- packing problem
- average distance
- undirected graph
- recognition algorithm
- convergence rate
- matching algorithm
- tree structure
- upper bound
- multi objective
- lower bound
- image sequences