π€ AI Summary
This paper addresses the challenge of automating choreme abstraction for categorical regional maps (e.g., isarithmic or land-use maps), where existing methods lack scalability and formal optimization. We propose a disk-based algorithmic summarization framework that models visual abstraction as a categorical point-set covering problem. By combining spatial sampling with combinatorial optimization, we efficiently compute a minimal set of representative disks capturing dominant spatial patterns. Our approach introduces the first extensible approximate algorithm framework for choreme generation, balancing visual fidelity and computational efficiency. Experiments demonstrate high-quality choreme summaries generated in seconds under moderate sampling densities; comparative evaluation across multiple sampling strategies confirms the methodβs effectiveness, robustness, and practical applicability. This work bridges a critical gap in automated choreme synthesis for categorical maps and establishes a novel paradigm for geographic visualization summarization.
π Abstract
Chorematic diagrams are highly reduced schematic maps of geospatial data and processes. They can visually summarize complex situations using only a few simple shapes (choremes) placed upon a simplified base map. Due to the extreme reduction of data in chorematic diagrams, they tend to be produced manually; few automated solutions exist. In this paper we consider the algorithmic problem of summarizing classed region maps, such as choropleth or land use maps, using a chorematic diagram with a single disk choreme. It is infeasible to solve this problem exactly for large maps. Hence, we propose several point sampling strategies and use algorithms for classed point sets to efficiently find the best disk that represents one of the classes. We implemented our algorithm and experimentally compared sampling strategies and densities. The results show that with the right sampling strategy, high-quality results can be obtained already with moderately sized point sets and within seconds of computation time.