English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/54146
logo share SHARE   Add this article to your Mendeley library MendeleyBASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Heuristic method to check the realisability of a graph into a rectangular plan

AuthorsRecuero, A.; Río, O.; Álvarez, M.
Mapping into rectangles
Architectural design
Issue Date2000
CitationAdvances in Engineering Software; 31 (3) : 223-231 (2000)
AbstractThe problem of mapping a graph into rectangles so that they cover a rectangular plan is considered. The graph may represent the basic scheme of a house or of a building, in which different design requirements are collected. To cope with this problem the authors have chosen a three steps approach: determining whether a graph can be mapped in this way (first step); automatically generating some of its realisations (second step); then how a given plan can be reduced to the rectangular one is analysed (third step). A heuristic approach to the general solution of the first step is proposed. It is a problem with a practical application in areas such as architectural design or compacting of electronic circuits, to which no general solution has been found in the specialised bibliography.
Publisher version (URL)http://www.sciencedirect.com/science/article/pii/S096599789900023X
Appears in Collections:(CISDEM) Artículos
Files in This Item:
There are no files associated with this item.
Show full item record
Review this work

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.