Generating grid maps via the snake model

June 04, 2024 ยท Entered Twilight ยท ๐Ÿ› Trans. GIS

๐Ÿ’ค TWILIGHT: Eternal Rest
Repo abandoned since publication

Repo contents: .idea, AlgEMLib, American.png, AuxStructureLib, CTMap.tif, CartoGener, DisplaceAlgLib.sln, DisplaceAlgLib.suo, DisplaceAlgLib, Experiment Data Circular cartogram, Experiment Data for Efficiency and Stable Circular Cartogram, GridMap.tif, Interface-1.png, Principle-1.png, Principle-2.png, README.md, USA-1.png, USA-2.png, UpgradeLog.XML, User study, _UpgradeReport_Files, interface-2.png, interface-3.png, interface-4.png

Authors Zhiwei Wei, Nai Yang, Wenjia Xu, Su Ding arXiv ID 2406.18573 Category cs.CV: Computer Vision Cross-listed cs.CY, cs.GR Citations 1 Venue Trans. GIS Repository https://github.com/TrentonWei/DorlingMap.git โญ 11 Last Checked 3 months ago
Abstract
The grid map, often referred to as the tile map, stands as a vital tool in geospatial visualization, possessing unique attributes that differentiate it from more commonly known techniques such as choropleths and cartograms. It transforms geographic regions into grids, which requires the displacement of both region centroids and boundary nodes to establish a coherent grid arrangement. However, existing approaches typically displace region centroids and boundary nodes separately, potentially resulting in self-intersected boundaries and compromised relative orientation relations between regions. In this paper, we introduce a novel approach that leverages the Snake displacement algorithm from cartographic generalization to concurrently displace region centroids and boundary nodes. The revised Constrained Delaunay triangulation (CDT) is employed to represent the relations between regions and serves as a structural foundation for the Snake algorithm. Forces for displacing the region centroids into a grid-like pattern are then computed. These forces are iteratively applied within the Snake model until a satisfactory new boundary is achieved. Subsequently, the grid map is created by aligning the grids with the newly generated boundary, utilizing a one-to-one match algorithm to assign each region to a specific grid. Experimental results demonstrate that the proposed approach excels in maintaining the relative orientation and global shape of regions, albeit with a potential increase in local location deviations. We also present two strategies aligned with existing approaches to generate diverse grid maps for user preferences. Further details and resources are available on our project website: https://github.com/TrentonWei/DorlingMap.git.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Computer Vision

๐ŸŒ… ๐ŸŒ… Old Age

Fast R-CNN

Ross Girshick

cs.CV ๐Ÿ› ICCV ๐Ÿ“š 27.7K cites 11 years ago