Marc van Kreveld
Alexander Wolff
ABSTRACT
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.
- Agarwal, P. K., Efrat, A., and Sharir, M. (1999). Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. SIAM J. Comput., 29:912--953. Google Scholar
Digital Library
- Arikawa, M. and Kambayashi, Y. (1991). Dynamic name placement functions for interactive map systems. The Australian Computer Journal, 23(4):133--147.Google Scholar
- Bentley, J. L. and Ottmann, T. A. (1979). Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput., C-28(9):643--647.Google ScholarDigital Library
- Chazelle, B. and Edelsbrunner, H. (1992). An optimal algorithm for intersecting line segments in the plane. J. ACM, 39(1):1--54. Google ScholarDigital Library
- de Berg, M., van Kreveld, M., Overmars, M., and Schwarzkopf, O. (2000). Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, Germany, 2nd edition. Google ScholarDigital Library
- Dent, B. D. (1999). Cartography: Thematic Map Design. McGraw-Hill, 5th edition.Google Scholar
- Edmondson, S., Christensen, J., Marks, J., and Shieber, S. (1997). A general cartographic labeling algorithm. Cartographica, 33(4):13--23.Google ScholarCross Ref
- Glassman, B., editor (1996). The Macmillan Visual Almanac. Macmillan, New York.Google Scholar
- Halperin, D. (2004). Arrangements. In Goodman, J. and O'Rourke, J., editors,Handbook of Discrete and Computational Geometry, chapter 24, pages 529--562. Chapman & Hall/CRC, Boca Raton, 2nd edition.Google Scholar
- Harrie, L., Stigmar, H., Koivula, T., and Lehto, L. (2004). An algorithm for icon placement on a real-time map. In Proc. 11th Int. Symp. on Spatial Data Handling.Google Scholar
- Hershberger, J. (1989). Finding the upper envelope of $n$ line segments in O(nlog n) time. Inform. Process. Lett., 33:169--174. Google ScholarDigital Library
- Mulmuley, K. (1993). Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, Englewood Cliffs, NJ.Google Scholar
- O'Rourke, J. (1995a). centroid.c. Available at ftp://cs.smith.edu/pub/code/centroid.c.Google Scholar
- O'Rourke, J. (1995b). Computational Geometry in C. Cambridge University Press, 2nd edition. Google ScholarDigital Library
- Pinto, I. and Freeman, H. (1996). The feedback approach to cartographic areal text placement. In Perner, P., Wang, P., and Rosenfeld, A., editors, Advances in Structural and Syntactical Pattern Recognition, pages 341--350. Springer-Verlag, New York. Google ScholarDigital Library
- Robinson, A., Morrison, J., Muehrcke, P., Kimerling, A., and Guptill, S. (1995). Elements of Cartography. John Wiley & Sons, New York, 6th edition.Google Scholar
- Tóth, G. F. (2004). Packing and covering. In Goodman, J. and O'Rourke, J., editors,Handbook of Discrete and Computational Geometry, chapter 2, pages 25--52. Chapman & Hall/CRC, Boca Raton, 2nd edition.Google Scholar
- van Roessel, J. W. (1989). An algorithm for locating candidate labeling boxes within a polygon. The American Cartographer, 16(3):201--209.Google ScholarCross Ref
- Wolff, A. and Strijk, T. (1996). The Map-Labeling Bibliography. http://i11www.ira.uka.de/map-labeling/bibliography/.Google Scholar
Index Terms
- Algorithms for the placement of diagrams on maps
Recommendations
Constraint Diagrams: A Step Beyond UML
TOOLS '99: Proceedings of the Technology of Object-Oriented Languages and SystemsThe Unified Modeling Language (UML) is a set of notations for modelling object-oriented systems. It has become the de facto standard. Most of its notations are diagrammatic. An exception to this is the Object Constraint Language (OCL) which is ...
Towards the Automatic Generation of Software Diagrams
The authors formulate the criteria for drawing dataflow diagrams and describe the placement and routing algorithms used in a system called MONDRIAN. A generalized approach to the question of software diagrams is proposed based on the authors' experience ...
Comments