Research and Advances
Artificial Intelligence and Machine Learning

The equivalence of the subregion representation and the wall representation for a certain class of rectangular dissections


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.

View this article in the ACM Digital Library.

Join the Discussion (0)

Become a Member or Sign In to Post a Comment

The Latest from CACM

Shape the Future of Computing

ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.

Get Involved

Communications of the ACM (CACM) is now a fully Open Access publication.

By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.

Learn More