Abstract
Proportional symbol maps visualize numerical data associated with point locations by placing a scaled symbol—typically an opaque disk or square—at the corresponding point on a map. The area of each symbol is proportional to the numerical value associated with its location. Every visually meaningful proportional symbol map will contain at least some overlapping symbols. These need to be drawn in such a way that the user can still judge their relative sizes accurately.
We identify two types of suitable drawings: physically realizable drawings and stacking drawings. For these we study the following two problems: Max-Min—maximize the minimum visible boundary length of each symbol—and Max-Total—maximize the total visible boundary length over all symbols. We show that both problems are NP-hard for physically realizable drawings. Max-Min can be solved in O(n 2log n) time for stacking drawings, which can be improved to O(nlog n) time when the input has certain properties. We also implemented several methods to compute stacking drawings: our solution to the Max-Min problem performs best on the data sets considered.
Article PDF
Similar content being viewed by others
References
Agarwal, P.K., Suri, S.: Surface approximation and geometric partitions. SIAM J. Comput. 27, 1016–1035 (1998)
Cabello, S., Demaine, E.D., Rote, G.: Planar embeddings of graphs with specified edge lengths. J. Graph Algorithms Appl. 11(1), 259–276 (2007)
de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Berlin (2008)
Demaine, E.D., Mitchell, J.S.B., O’Rourke, J.: The open problems project. Problem 33. http://maven.smith.edu/orourke/TOPP/P33.html
Dent, B.: Cartography—Thematic Map Design, 5th edn. McGraw-Hill, New York (1999)
Fortnow, L.: Computational Complexity Blog. Post of Friday, February 14, 2003. http://weblog.fortnow.com/archive/2003_02_01_archive.html
Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Inf. Process. Lett. 12(3), 133–137 (1981)
Giora, Y., Kaplan, H.: Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. In: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms, pp. 19–28 (2007)
Griffin, T.: The importance of visual contrast for graduated circles. Cartography 19(1), 21–30 (1990)
Groop, R.E., Cole, D.: Overlapping graduated circles: Magnitude estimation and method of portrayal. Can. Cartogr. 15(2), 114–122 (1978)
Imai, H., Asano, T.: Dynamic orthogonal segment intersection search. J. Algorithms 8, 1–18 (1987)
Kedem, K., Livne, R., Pach, J., Sharir, M.: On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete Comput. Geom. 1, 59–71 (1986)
Knuth, D.E., Raghunathan, A.: The problem of compatible representatives. SIAM J. Discrete Math. 5, 422–427 (1992)
Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput. 11(2), 329–343 (1982)
Mehlhorn, K., Näher, S.: Dynamic fractional cascading. Algorithmica 5, 215–241 (1990)
NOAA Satellite and Information Service. National geophysical data center, 2005. http://www.ngdc.noaa.gov
Queensland University Advanced Centre for Earthquake Studies. http://www.quakes.uq.edu.au
Sharir, M.: On k-sets in arrangements of curves and surfaces. Discrete Comput. Geom. 6, 593–613 (1991)
Slocum, T.A., McMaster, R.B., Kessler, F.C., Howard, H.H.: Thematic Cartography and Geographic Visualization, 2nd edn. Prentice Hall, New York (2003)
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version of this paper appeared in the Proceedings of the 14th European Symposium on Algorithms, pp. 720–731, LNCS, vol. 4168, Springer, 2006.
Research of S. Cabello partially supported by the Slovenian Research Agency, project J1-7218.
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Cabello, S., Haverkort, H., van Kreveld, M. et al. Algorithmic Aspects of Proportional Symbol Maps. Algorithmica 58, 543–565 (2010). https://doi.org/10.1007/s00453-009-9281-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-009-9281-8