Abstract
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. © 2008 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Bandeira, L., Pina, P., & Saraiva, J. (2008). A new approach to analyse neighbourhood relations in 2D polygonal networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5197 LNCS, pp. 397–404). https://doi.org/10.1007/978-3-540-85920-8_49
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
