FAST-CBL：A Fast Algorithm for Block Placement based on Corner Block List
碩士 === 南華大學 === 資訊管理學研究所 === 91 === In [3, 4], Hong et al introduced an elegant and efficient topological representation of block placement called corner block list which takes only linear time to construct the floorplan. In this paper, algorithm based on the corner block list placement algor...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/42074198455926074109 |
| Summary: | 碩士 === 南華大學 === 資訊管理學研究所 === 91 === In [3, 4], Hong et al introduced an elegant and efficient topological representation of block placement called corner block list which takes only
linear time to construct the floorplan.
In this paper, algorithm based on the corner block list placement algorithm
in each perturbation：Not the same as the corner block list must takes O(n) to verification if a representation is infeasible, FAST-CBL only takes O(1) to the verification. Experimental results show the promise of the FAST-CBL based algorithm.
|
|---|