A New Approach to Analyse Neighbourhood Relations in 2D Polygonal Networks

摘要

A new algorithm to identify the neighbours of polygons on 4-connected raster images of 2D polygonal networks is presented in this paper. It is mainly based on mathematical morphology operators and can be indistinctively applied to networks of tri and tetravalent nature (with three and four edges at each vertex, respectively). The algorithm is tested on a varied set of polygonal terrains occurring on the surface of Mars and its computational performance compared to other approaches.