An algorithm for accurate and simple-looking metaphorical maps

2025-08-27

AI Summary

Existing metaphor map algorithms struggle to balance polygonal simplicity with area-preserving accuracy, often exhibiting area distortions up to 30%. This paper proposes an enhanced force-directed metaphor map generation method that improves area fidelity via two key innovations: (1) an adaptive regional stiffness modulation mechanism and (2) a narrow-passage-aware edge weighting scheme. Furthermore, we extend the algorithm beyond triangulated graphs for the first time—handling complex topologies through intersection-based node insertion and controllable hole generation. Our approach integrates force-directed layout, regional pressure control, geometric point optimization, and topology-aware robustification. Experimental results demonstrate that area error is reduced to under 1%, with only marginal degradation in polygonal simplicity—significantly outperforming state-of-the-art methods. This work establishes a new paradigm for high-fidelity, interpretable geographic visualization.

Technology Category

• Search and Optimization: Metareasoning and Metaheuristics
• Knowledge Representation and Reasoning: Geometric, Spatial, and Temporal Reasoning
• Planning, Routing, and Scheduling: Optimization of Spatio-temporal Systems

Application Category

• Graph Algorithms and Modeling for the Web: Efficient manipulation of static and dynamic Web-related graphs
• Web Mining and Content Analysis: Web data visualization
• Semantics and Knowledge: Methods, algorithms and applications for the development of semantic models, knowledge graphs and other forms of structured data models with machine-interpretable semantics

Abstract

"Metaphorical maps" or "contact representations" are visual representations of vertex-weighted graphs that rely on the geographic map metaphor. The vertices are represented by countries, the weights by the areas of the countries, and the edges by contacts/ boundaries among them. The accuracy with which the weights are mapped to areas and the simplicity of the polygons representing the countries are the two classical optimization goals for metaphorical maps. Mchedlidze and Schnorr [Metaphoric Maps for Dynamic Vertex-weighted Graphs, EuroVis 2022] presented a force-based algorithm that creates metaphorical maps that balance between these two optimization goals. Their maps look visually simple, but the accuracy of the maps is far from optimal - the countries' areas can vary up to 30% compared to required. In this paper, we provide a multi-fold extension of the algorithm in [Metaphoric Maps for Dynamic Vertex-weighted Graphs, EuroVis 2022]. More specifically: 1. Towards improving accuracy: We introduce the notion of region stiffness and suggest a technique for varying the stiffness based on the current pressure of map regions. 2. Towards maintaining simplicity: We introduce a weight coefficient to the pressure force exerted on each polygon point based on whether the corresponding point appears along a narrow passage. 3. Towards generality: We cover, in contrast to [Metaphoric Maps for Dynamic Vertex-weighted Graphs, EuroVis 2022], non-triangulated graphs. This is done by either generating points where more than three regions meet or by introducing holes in the metaphorical map. We perform an extended experimental evaluation that, among other results, reveals that our algorithm is able to construct metaphorical maps with nearly perfect area accuracy with a little sacrifice in their simplicity.

Problem

• Improving area accuracy in metaphorical map visualizations
• Maintaining polygon simplicity while enhancing accuracy
• Extending algorithm to handle non-triangulated graphs

Innovation

• Introduces region stiffness for improved accuracy
• Adds weight coefficient to maintain polygon simplicity
• Extends algorithm to non-triangulated graphs