Finding Groups in Cartographic Design Solution Spaces: A Connected Component Labeling Approach
ISBN 978-85-88783-11-9
Authors
1Papakonstantinou, A.; 2Soulakellis, N.; 3Kyriakidis, P.; 4Kyriakidis, P.
1UNIVERSITY OF THE AEGEAN Email: apapak@geo.aegean.gr
2UNIVERSITY OF THE AEGEAN Email: nsoul@aegean.gr
3UNIVERSITY OF THE AEGEAN Email: phkyriakidis@geo.aegean.gr
4UNIVERSITY OF CALIFORNIA SANTA BARBARA Email: phkyriakidis@geo.aegean.gr
Abstract
This paper proposes an approach for grouping solutions in cartographic design optimization problems, such as the placement of map insets, using mathematical morphology operators. More specifically, we propose an efficient methodology to assign provisional labels to groups of points denoting locations where favorable conditions exist, through the use of run length encoding of connected component labels in binary raster maps. Our approach is demonstrated using results from the Inset Map-per (IM) software for inset placement in cartographic design. We present an application of our approach in detecting solution (in this case optimal positioning of an inset) groups in space, analyzing its complexity and providing experimental results. The proposed methodology is simple in principle, can be easily implemented, and is expected to facilitate processing in cartographic applications involving the assignment of group labels to per-point solutions of cartographic design problems, such as inset map placement.
Keywords
Grouping Spatial Solutions; Inset Maps; Clustering