Proximity-based grouping of buildings in urban blocks: a comparison of four algorithms |
| |
| Authors: | Sinan Cetinkaya Melih Basaraner Dirk Burghardt |
| |
| Institution: | 1. Division of Cartography, Faculty of Civil Engineering, Department of Geomatic Engineering, Yildiz Technical University (YTU), Istanbul, Turkey;2. Institute for Cartography, Dresden University of Technology, Dresden, Germany |
| |
| Abstract: | Grouping of buildings based on proximity is a pre-processing step of urban pattern (structure) recognition for contextual cartographic generalization. This paper presents a comparison of grouping algorithms for polygonal buildings in urban blocks. Four clustering algorithms, Minimum Spanning Tree (MST), Density-Based Spatial Clustering Application with Noise (DBSCAN), CHAMELEON and Adaptive Spatial Clustering based on Delaunay Triangulation (ASCDT) are reviewed and analysed to detect building groups. The success of the algorithms is evaluated based on group distribution characteristics (i.e. distribution of the buildings in groups) with two methods: S_Dbw and newly proposed Cluster Assessment Circles. A proximity matrix of the nearest distances between the building polygons, and Delaunay triangulation of building vertices are created as an input for the algorithms. A topographic data-set at 1:25,000 scale is used for the experiments. Urban block polygons are created to constrain the clustering processes from topological aspect. Findings of the experiment demonstrate that DBSCAN and ASCDT are superior to CHAMELEON and MST. Among them, MST has exhibited the worst performance for finding meaningful building groups in urban blocks. |
| |
| Keywords: | grouping of buildings cluster assessment spatial pattern cartographic generalization |
|
|
