Mapping a rectangle into rectangles covering a given plan
DOI:
https://doi.org/10.3989/ic.1995.v47.i437.1074Abstract
In this paper, the problem of mapping a graph into a set of rectangles covering a given plan is analyzed. The plan must have its sides parallel to two perpendicular directions. The graph may represent the basic scheme of a housing or a building, in which the different design requirements are collected. To this aim, the problem of partitioning a rectangle into rectangles is analyzed. It consists in determining whether a given graph can be realized this way, and if so, automatically generate some of its realizations. A general method is proposed to solve both aspects of the problem. It is a problem with practical application in areas such as architectural design or compaction of electronic circuits, to which no general solution has been found in the specialized bibliography.
Downloads
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 1995 Consejo Superior de Investigaciones Científicas (CSIC)
This work is licensed under a Creative Commons Attribution 4.0 International License.
© CSIC. Manuscripts published in both the print and online versions of this journal are the property of the Consejo Superior de Investigaciones Científicas, and quoting this source is a requirement for any partial or full reproduction.
All contents of this electronic edition, except where otherwise noted, are distributed under a Creative Commons Attribution 4.0 International (CC BY 4.0) licence. You may read the basic information and the legal text of the licence. The indication of the CC BY 4.0 licence must be expressly stated in this way when necessary.
Self-archiving in repositories, personal webpages or similar, of any version other than the final version of the work produced by the publisher, is not allowed.
