Finding the upper envelope of n line segments in O(n log n) time
Information Processing Letters
An optimal algorithm for intersecting line segments in the plane
Journal of the ACM (JACM)
Computational geometry in C
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
SIAM Journal on Computing
The Feedback Approach to Cartographic Areal Text Placement
SSPR '96 Proceedings of the 6th International Workshop on Advances in Structural and Syntactical Pattern Recognition
Graph Drawing
A chorem-based approach for visually synthesizing complex phenomena
Information Visualization
Two map labeling algorithms for GIS applications
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Hi-index | 0.00 |
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.