Methods of rectangular Cartogram automatic construction

doi:10.13474/j.cnki.11-2246.2020.0189

Abstract

Abstract: Rectangular Cartogram, as a kind of regional Cartogram which can express topology and data attributes at the same time, has great potential because of its simple and intuitive expression content. Rectangular Cartogram attempts to use simple rectangles to represent the topology and data attributes of complex geography. These two attributes are often contradictory in the process of automatic construction, so there are many different construction methods. The research on the automatic construction method is helpful to the exploration of the integration method of geographic information and statistical data. In this paper, firstly, the research background, research status and significance of rectangular Cartogram are briefly introduced. Then, the characteristics and evaluation criteria of rectangular Cartogram are summarized, and two typical algorithms of constructing rectangular Cartogram are analyzed, and the difficulties of automatic construction algorithm are summarized. Finally, the existing problems in the research of rectangular Cartogram are discussed, and its development direction is prospected.

Key words: Cartogram, rectangular Cartogram, construction method, planar layout, appropriate cognition

CLC Number:

P285

WANG Weiming, JIA Fenli. Methods of rectangular Cartogram automatic construction[J]. Bulletin of Surveying and Mapping, 2020, 0(6): 99-103,117.

References

[1] MILLER A. TED talk:the news about the news[EB/OL].(2019-01-21)[2019-03-20] http://www.ted.com/talks/alisa miller shares the news about the news.
[2] Worldmapper.[EB/OL].(2018-01-22)[2019-3-20]. http://www.worldmapper.org/.
[3] 赵正旭,任利敬.基于Cartogram可视化的信息传承方法研究[J].中国人口资源与环境,2016,26(5):526-529.
[4] PAPPENBERGER F, CLOKE H L,BAUGH C A. Cartog-rams for use in forecasting weather-driven natural hazards[J].The Cartographic Journal,2019,56:134-145.
[5] 艾廷华. 适宜空间认知结果表达的地图形式[J]. 遥感学报, 2008, 12(2):347-354.
[6] RAISZ E. The rectangular statistical cartogram[J]. Geogra-phical Review, 1934, 24(2):292-296.
[7] 王丽娜, 江南, 李响,等. Cartogram表示方法研究综述[J]. 计算机辅助设计与图形学学报, 2017, 29(3):393-405.
[8] NUSRAT S, KOBOUROV S. The state of the art in cartograms[J].Computer Graphics Forum, 2016, 35(3):619-642.
[9] TOBLER W. Thirty five years of computer cartograms[J]. Annals of the Association of American Geographers, 2004, 94(1):58-73.
[10] NUSRAT S, ALAM M, KOBOUROV S G. Evaluating cartogram effectiveness[OL].[2019-03-13]. https://arxiv.org/pdf/1504.02218.pdf.
[11] ALAM M J, KOBOUROV S G, VEERAMONI S. Quantitative measures for cartogram generation techniques[J]. Computer Graphics Forum, 2015, 34(3):351-360.
[12] BUCHIN K, SPECKMANN B, VERDONSCHOT S. Evolution strategies for optimizing rectangular cartograms[C]//Lecture Notes in Computer Science. Heidelberg:Springer, 2012.
[13] HEILMANN R, KEIM D A, PANSE C, et al. RecMap:rectangular map approximations[C]//Proceedings of IEEE Symposium on Information Visualization. Los Alamitos:IEEE Computer Society Press, 2004:33-40.
[14] VAN KREVELD M, SPECKMANN B. On rectangular cartograms[C]//Lecture Notes in computer Science. Heidelberg:Springer, 2004.
[15] VAN KREVELD M, SPECKMANN B. Rectangular cartogram computation with sea regions[C]//Proceedings of 22st Cartographic Conference. A coruña:[s.n.], 2005.
[16] SPECKMANN B, VAN KREVELD M, FLORISSON S. A linear programming approach to rectangular cartograms[C]//Progress in Spatial Data Handling. Heidelberg:Springer, 2006:529-546.
[17] CARRIZOSA E, GUERRERO V, ROMERO MORALES D. On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps[J].European Journal of Operational Research, 2018, 265(1):290-302.
[18] LIAO C C, LU H I, YEN H C.Floor-planning via orderly spanning trees[C]//Lecture Notes in Computer Science. Heidelberg:Springer, 2002.
[19] DE BERG M, MUMFORD E, SPECKMANN B. On rectilinear duals for vertex-weighted plane graphs[J]. Discrete Mathematics, 2009, 309(7):1794-1812.
[20] RAHMAN M S, MIURA K, NISHIZEKI T. Octagonal drawings of plane graphs with prescribed face areas[J]. Computational Geometry, 2009, 42(3):214-230.
[21] ALAMM J, BIEDL T C, FELSNER S, et al. Computing cartograms with optimal complexity[J].Discrete & Computational Geometry,2013, 50(3):784-810.
[22] INOUE R, SHIMIZU E. A new algorithm for continuous area cartogram construction with triangulation of regions and restriction on bearing changes of edges[J]. Cartography and Geographic Information Science, 2006, 33(2):115-125.
[23] INOUE R, KITAURA K, SHIMIZU E. New solution for construction of rectilinear area cartogram[EB/OL].[2019-03-20]. https://icaci.org/files/documents/ICC_proceedings/ICC2009/html/refer/20_3.pdf.
[24] CANO R G, BUCHIN K, CASTERMANS T, et al. Mosaic drawings and cartograms[J]. Computer Graphics Forum, 2015, 34(3):361-370.
[25] JHONG S Y, LIN C C, LIU W Y, et al. Rectangular cartogram visualization interface for social networks[C]//Communications in Computer and Information Science. Heidelberg:Springer, 2011.
[26] BUCHIN K, EPPSTEIN D, LÖFFLER M, et al. Adjacency-preserving spatial TreeMaps[C]//Lecture Notes in Computer Science. Heidelberg:Springer, 2011.
[27] SLINGSBY A, DYKES J, WOOD J. Rectangular hierarchical cartograms for socio-economic data[J]. Journal of Maps, 2010, 6(1):330-345.
[28] KANT G, HE X. Two algorithms for finding rectangular duals of planar graphs[C]//Lecture Notes in Computer Science. Heidelberg:Springer, 1994.
[29] BHASKER J, SAHNI S. A linear algorithm to check for the existence of a rectangular dual of a planar triangulated graph[J]. Networks, 1987, 17(3):307-317.
[30] KANT G, HE X. Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems[J]. Theoretical Computer Science, 1997, 172(1-2):175-193.
[31] HE X. On finding the rectangular duals of planar triangulated graphs[J]. SIAM Journal on Comput,1993, 22(6):1218-1226.
[32] BUCHIN K, SPECKMANN B, VERDONSCHOT S. Optimizing regular edge labelings[C]//Lecture Notes in Computer Science. Heidelberg:Springer, 2011.
[33] FUSY E. Transversal structures on triangulations:a combinatorial study and straight-line drawings[J]. Discrete Mathematics, 2009, 309(7):1870-1894.