An efficient algorithm for partitioning parameterized polygons into rectangles.
I-Lun TsengAdam PostulaPublished in: ACM Great Lakes Symposium on VLSI (2006)
Keyphrases
- significant improvement
- times faster
- preprocessing
- high accuracy
- learning algorithm
- optimal solution
- improved algorithm
- computationally efficient
- detection algorithm
- convergence rate
- theoretical analysis
- cost function
- selection algorithm
- worst case
- genetic algorithm
- computational cost
- experimental evaluation
- dynamic programming
- np hard
- graph partitioning
- recognition algorithm
- memory efficient
- data sets
- partitioning algorithm
- path planning
- ant colony optimization
- clustering method
- optimization algorithm
- segmentation algorithm
- particle swarm optimization
- simulated annealing
- k means
- search space
- computational complexity
- objective function