A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Transforming an adjacency matrix into a planar graph
Abstract A model for transforming a non planar graph, presenting the interrelations interrelations required in the adjacency matrix, into a planar one, was developed. This is achieved through cancelling some of the links in the graph. The algorithm is based on trying to minimize two factors: the number of cancelled links and their weight. The planar graph obtained is unfolded to get a graph drawn without crossing links. A graph dual to this unfolded planar graph can be considered as a schematic layout. The suggested approach to the layout problem is demonstrated through some case studies.
Transforming an adjacency matrix into a planar graph
Abstract A model for transforming a non planar graph, presenting the interrelations interrelations required in the adjacency matrix, into a planar one, was developed. This is achieved through cancelling some of the links in the graph. The algorithm is based on trying to minimize two factors: the number of cancelled links and their weight. The planar graph obtained is unfolded to get a graph drawn without crossing links. A graph dual to this unfolded planar graph can be considered as a schematic layout. The suggested approach to the layout problem is demonstrated through some case studies.
Transforming an adjacency matrix into a planar graph
Hashimshony, R. (author) / Shaviv, E. (author) / Wachman, A. (author)
Building and Environment ; 15 ; 205-217
1980-01-01
13 pages
Article (Journal)
Electronic Resource
English
Generation of rectangular dissections using directed adjacency graph
| British Library Online Contents | 2001
| DOAJ | 2023
Optimizing Spatial Adjacency in Hospital Master Planning
| British Library Conference Proceedings | 2019