For most of the architectural design problems, there are underlying mathematical sub-problems, they may require to consider for generating architectural layouts. One of these sub-problems is to satisfy adjacency constraints for obtaining an initial layout. But in the literature, there does not exist a mathematical procedure that can address any given adjacency requirements, i.e., there does not exist a tool for generating a floor plan corresponding to any given adjacency (planar) graph (there exist algorithms for constructing floor plans for planar triangulated graphs only). In this paper, we are going to present an algorithm that would generate a floor plan corresponding to any given planar graph. The larger aim of this research is to develop a user-friendly tool that can generate a variety of initial layouts corresponding to a given graph, which can be further modified by the architects/designers.
| Authors | Krishnendra Shekhawat and Pinki Pinki |
|---|---|
| Year | 2020 |
| Venue | RE: Anthropocene, Design in the Age of Humans - Proceedings of the 25th International Conference on Computer-Aided Architectural Design Research in Asia, CAADRIA 2020 |
| DOI | 10.52842/CONF.CAADRIA.2020.1.315 |
| Source Database | Seed (CumInCAD) |
| Bridge-to-GNN | Category Seed |
| GNN Architecture | Not yet extracted from PDF |
| Graph Encoding | Room Adjacency Graph (inferred from title) |
| AEC Task | Not yet extracted from PDF |
| Cohort | Early Infrastructure (2020–2021) |
| Primary Metric | R² (heuristic — verify) |
|---|---|
| Key Finding | algorithm for generating floor plans for non-triangulated graphs (which can obviously be used for triangulated graphs) (heuristic — verify) |
Part of the GML/GNN in AEC Systematic Review (PRISMA 2020) — 112 papers, 2020–2026