An Optimal Algorithm for One-Separation of a Set of Isothetic Polygons.
Amitava DattaKamala KrithivasanThomas OttmannPublished in: CIAC (1997)
Keyphrases
- optimal solution
- minimum length
- convex hull
- computational complexity
- dynamic programming
- worst case
- learning algorithm
- experimental evaluation
- input data
- globally optimal
- computational cost
- cost function
- exhaustive search
- matching algorithm
- detection algorithm
- optimization algorithm
- optimality criterion
- neural network
- objective function
- average distance
- search space
- solution space
- preprocessing
- initial set
- polygonal approximation
- np hard
- decomposition algorithm
- optimal weights
- times faster
- segmentation algorithm
- linear programming
- simulated annealing
- significant improvement
- state space