Realisations of a Graph into Rectangles Covering a Rectangle: Building Floor Plan Design

摘要

The implementation of a heuristic method to check the realisability of a graph into rectangles covering a rectangular plan is presented. For the sake of portability C has been chosen as programming language. The problem is of interested in applications such as the automated generation of floor plans for architectural design, were functional requirements can be represented by graphs. It provides the designer, in the first step of the process, with a complete set of distributions of the floor plan.