Abstract

Early design phases in architecture deal with the conceptualization of a building. During these phases, a high-level description of a building (usually coming from a contractor of costumer) is iteratively turned into a first floor plan layout. One established method for architects to get inspiration is the search of references from former building projects. However, this search is usually conducted manually (and therefore labor-intensive) nowadays. Hence, an automated search for similar architectural concepts is desired. In the course of this paper, case-based reasoning and (in)exact graph matching are utilized to construct an end-to-end system for floor plan retrieval, accessible by a refined version of our design-supporting web interface. In our approach, a floor plan is modeled as a graph, where each room is represented as a node and the relations between rooms are modeled as edges. We use a set of high-level abstractions, so-called semantic fingerprints, to generate simplified graphs that are simple to match. The retrieval process itself is performed by three systems (case-based reasoning, exact graph matching and inexact graph matching), whose results are unified internally. We conducted several tests to show the deployment ability of our system: firstly, we run a stress-test for determining the computational limits our system can handle. Secondly, we tested our system qualitatively and showed that each retrieval system is superior in at least one search scenario.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.