An algorithm for exhaustive generation of building floor plans
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Automated layout in ASHLAR: An approach to the problems of “General Cell” layout for VLSI
DAC '82 Proceedings of the 19th Design Automation Conference
Placement algorithms for arbitrarily shaped blocks
DAC '79 Proceedings of the 16th Design Automation Conference
Towards the Automatic Generation of Software Diagrams
IEEE Transactions on Software Engineering
Interactive physically-based manipulation of discrete/continuous models
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
| Hi-index | 48.22 |
A rectangular dissection is a partition of a rectangular space R info n ≱ 1 disjoint rectangles {r1, r2, . . ., rn. Two classes of dissections that are of particular interest in floor-space design and very-large-scale integration (VLSI) space partitioning are called T-plans and T*-plans, where the T*-plans form a subclass of the T-plans. We consider here the subregion tree representation t(D) of a T*-plan D, which describes the successive partitioning operations by which the dissection D is derived. There are four types of partitioning operations in a T*-plan: (1) the horizontal partitioning; (2) the vertical partitioning; (3) the left-spiral partitioning; and (4) the right-spiral partitioning. We show that for a T*-plan the subregion representation and the wall representation are equivalent in the sense that one can be obtained from the other in a unique fashion. The importance of this equivalence property lies in that while the two representations allow different types of design constraints to be represented in a more natural way, these constraints may be converted to the same representation for a more efficient solution of the design problem.