Comparing two floors on the coarsest resolution

Spatial Similarity Metrics

Graph theoretic distance measurement and floor plan abstraction

Grasl T and Economou A

Com­par­ing space allo­ca­tion pro­grams com­pu­ta­tion­ally is a resource inten­sive task. This paper intro­duces a method which reduces the com­plex­ity of floor plan graphs to facil­i­tate the prob­lem. In a first step the nodes are labeled accord­ing to a laid out clas­si­fi­ca­tion scheme. This in its own right reduces the com­plex­ity of the com­par­i­son by intro­duc­ing more diver­sity among the nodes.

Sub­se­quently the graph can be coars­ened in sev­eral steps based on the cat­e­gory infor­ma­tion. This does not only fur­ther reduce the nec­es­sary com­pu­ta­tion, but can also offer a visu­al­iza­tion of and addi­tional insight into the essen­tial struc­ture of the space allo­ca­tion pro­gram at hand.

CAAD Futures
11-13 July 2007
Sydney (Australia)