Algorithms for the placement of diagrams on maps

This paper discusses a variety of ways to place diagrams like pie charts on maps, in particular, administrative subdivisions. The different ways come from different models of the placement problem: a diagram of one region should cover other regions, roads or boundaries as little as possible. In total we present six models for diagram placement. We outline three different algorithmic approaches and discuss the efficiency of each approach for the different models, and also for different types of diagrams (rectangular, circular, same or different sizes). We have implemented an algorithm for each model and show the resulting diagram placements on a number of maps. Our evaluation gives a first indication which model is best for aesthetically good diagram placement. Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems--Geometrical problems and computations General Terms Algorithms, Experimentation This work was start...

• Type: Conference
• Year: 2004
• Where: GIS
• Authors: Étienne Schramm, Alexander Wolff, Marc J. van Kreveld
• Keywords: Database, Diagram Placements, General Terms Algorithms, GIS 2004, Keywords Placement Algorithms