Elastic beam algorithm for generating circular cartograms

Wei, Zhiwei; Ding, Sheng; Xu, Wenjia; Lu, Cheng; Zhang, Song; Wang, Yan

doi:10.1080/15230406.2023.2196732

Cited by 4 publications

(1 citation statement)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Burghardt and Meier [15] first introduced the snake displacement model in cartographic generalization for curve displacement, and Bader [9] proposed the beam displacement model. Snake and beam displacement models have been employed to address road and building generalization [10,[16][17][18][19][20].…”

Section: Introductionmentioning

confidence: 99%

Collaborative Methods of Resolving Road Graphic Conflicts Based on Cartographic Rules and Generalization Operations

Zheng,

Guo,

Wang

et al. 2024

IJGI

View full text Add to dashboard Cite

The resolution of road graphic conflicts is a key aspect of map generalization, which involves both scale reduction and the symbolization of map features. This study proposes collaborative methods of road graphic conflict resolution considering different road characteristics. These methods consider both geometric and semantic characteristics, and they incorporate the bend characteristics of roads, the road symbol size, and road semantics. Constrained Delaunay triangulation skeleton lines are used to categorize road graphic conflicts, which are made up of four independent conflict types and four group conflict types. Based on their characteristics, three collaborative methods are designed to deal with the different types of road graphic conflicts: collaboration between deletion and the snake displacement model, collaboration between the snake displacement model and collinearity, and collaboration among simplification, smoothing, and the beam displacement model. Two types of independent conflicts can be processed using only one simple operation. This study summarizes the cartographic rules for resolving road graphic conflicts, and these are used along with geometric features to drive the collaborative methods or one simple operation presented here. The experimental results indicate that the method proposed in this study can effectively resolve road graphic conflicts.

show abstract

Section: Introductionmentioning

confidence: 99%

Collaborative Methods of Resolving Road Graphic Conflicts Based on Cartographic Rules and Generalization Operations

Zheng,

Guo,

Wang

et al. 2024

IJGI

View full text Add to dashboard Cite

show abstract

REA-FM: automated generation of natural-looking flow maps through river extraction algorithm

Wei,

Ding,

et al. 2024

Cartography and Geographic Information Science

View full text Add to dashboard Cite

Generating grid maps via the snake model

Wei,

Yang,

Wenjia

et al. 2024

Transactions in GIS

View full text Add to dashboard Cite

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 article, 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.

show abstract

Elastic beam algorithm for generating circular cartograms

Cited by 4 publications

References 22 publications

Collaborative Methods of Resolving Road Graphic Conflicts Based on Cartographic Rules and Generalization Operations

Collaborative Methods of Resolving Road Graphic Conflicts Based on Cartographic Rules and Generalization Operations

REA-FM: automated generation of natural-looking flow maps through river extraction algorithm

Generating grid maps via the snake model

Contact Info

Product

Resources

About