Abstract
We present an algorithm to compute schematic maps with circular arcs. Our algorithm iteratively replaces two consecutive arcs with a single arc to reduce the complexity of the output map and thus to increase its level of abstraction. Our main contribution is a method for replacing arcs that meet at high-degree vertices. This allows us to greatly reduce the output complexity, even for dense networks. We experimentally evaluate the effectiveness of our algorithm in three scenarios: territorial outlines, road networks, and metro maps. For the latter, we combine our approach with an algorithm to more evenly distribute stations. Our experiments show that our algorithm produces high-quality results for territorial outlines and metro maps. However, the lack of caricature (exaggeration of typical features) makes it less useful for road networks.
A. van Goethem and B. Speckmann are supported by the Netherlands Organisation for Scientific Research (NWO) under project no. 612.001.102 (AvG) and no. 639.023.208 (BS). T. van Dijk is supported by DFG-grant Ha5451/3-1. Collaboration started at Dagstuhl seminar 13151 “Drawing graphs and maps with curves.”
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cabello, S., De Berg, M., Van Kreveld, M.: Schematization of networks. Comp. Geometry: Theory & Appl. 30(3), 223–238 (2005)
De Chiara, D., Del Fatto, V., Laurini, R., Sebillo, M., Vitiello, G.: A chorem-based approach for visually analyzing spatial data. J. of Visual Languages & Computing 22(3), 173–193 (2011)
Merrick, D., Gudmundsson, J.: Path simplification for metro map layout. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 258–269. Springer, Heidelberg (2007)
Neyer, G.: Line simplification with restricted orientations. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol. 1663, pp. 13–24. Springer, Heidelberg (1999)
Brunet, R.: La composition des modèles dans l’analyse spatiale. Espace géographique 9(4), 253–265 (1980)
Buchin, K., Meulemans, W., Speckmann, B.: A new method for subdivision simplification with applications to urban-area generalization. In: Proc. 19th ACM SIGSPATIAL GIS, pp. 261–270 (2011)
Nöllenburg, M., Wolff, A.: A mixed-integer program for drawing high-quality metro maps. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 321–333. Springer, Heidelberg (2006)
Stott, J., Rodgers, P., Martinez-Ovando, J., Walker, S.: Automatic metro map layout using multicriteria optimization. IEEE TVCG 17(1), 101–114 (2011)
Koffka, K.: Principles of Gestalt psychology. Routledge (2013)
Delling, D., Gemsa, A., Nöllenburg, M., Pajor, T.: Path schematization for route sketches. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol. 6139, pp. 285–296. Springer, Heidelberg (2010)
Gemsa, A., Nöllenburg, M., Pajor, T., Rutter, I.: On d-regular schematization of embedded paths. In: Černá, I., Gyimóthy, T., Hromkovič, J., Jefferey, K., Králović, R., Vukolić, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol. 6543, pp. 260–271. Springer, Heidelberg (2011)
Cicerone, S., Cermignani, M.: Fast and simple approach for polygon schematization. In: Murgante, B., Gervasi, O., Misra, S., Nedjah, N., Rocha, A.M.A.C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2012, Part I. LNCS, vol. 7333, pp. 267–279. Springer, Heidelberg (2012)
Ti, P., Li, Z.: Generation of schematic network maps with automated detection and enlargement of congested areas. Int. J. of Geographical Information Science 28(3), 521–540 (2014)
Roberts, M., Newton, E., Lagattolla, F., Hughes, S., Hasler, M.: Objective versus subjective measures of Paris metro map usability: Investigating traditional octolinear versus all-curves schematic maps. Int. J. of Human Computer Studies 71, 363–386 (2013)
Reimer, A.W.: Understanding chorematic diagrams: Towards a taxonomy. Cartographic J. 47(4), 330–350 (2010)
Drysdale, R., Rote, G., Sturm, A.: Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs. Comp. Geometry: Theory & Appl. 41(1-2), 31–47 (2008)
Heimlich, M., Held, M.: Biarc approximation, simplification and smoothing of polygonal curves by means of Voronoi-based tolerance bands. Int. J. of Comp. Geometry & Appl. 18(3), 221–250 (2008)
van Goethem, A., Meulemans, W., Reimer, A., Haverkort, H., Speckmann, B.: Topologically safe curved schematisation. Cartographic J. 50(3), 276–285 (2013)
van Goethem, A., Meulemans, W., Speckmann, B., Wood, J.: Exploring curved schematization. In: Proc. 7th IEEE PacificVis., pp. 1–8 (2014)
Fink, M., Haverkort, H., Nöllenburg, M., Roberts, M., Schuhmann, J., Wolff, A.: Drawing metro maps using Bézier curves. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 463–474. Springer, Heidelberg (2013)
Thomson, R., Brooks, R.: Exploiting perceptual grouping for map analysis, understanding and generalization: The case of road and river networks. In: Blostein, D., Kwon, Y.-B. (eds.) GREC 2001. LNCS, vol. 2390, pp. 148–157. Springer, Heidelberg (2002)
Rote, G.: Computing the Fréchet distance between piecewise smooth curves. Comp. Geometry: Theory & Appl. 37(3), 162–174 (2007)
Merrick, D., Gudmundsson, J.: Increasing the readability of graph drawings with centrality-based scaling. In: Proc. 2006 Asia-Pacific Symp. Info. Vis., pp. 67–76 (2006)
van Dijk, T.C., Haunert, J.H.: Interactive focus maps using least-squares optimization. Int. J. of Geographical Information Science (2014), doi:10.1080/13658816.2014.887718
Nöllenburg, M.: An improved algorithm for the metro-line crossing minimization problem. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 381–392. Springer, Heidelberg (2010)
Lecordix, F., Plazanet, C., Lagrange, J.P.: PlaGe: a platform for research in generalization. application to caricature. Geo Informatica 1(2), 161–182 (1996)
van Dijk, T.C., Van Goethem, A., Haunert, J.H., Meulemans, W., Speckmann, B.: Accentuating focus map via partial schematization. In: Proc. 21st ACM SIGSPATIAL GIS, pp. 438–441 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
van Dijk, T.C., van Goethem, A., Haunert, JH., Meulemans, W., Speckmann, B. (2014). Map Schematization with Circular Arcs. In: Duckham, M., Pebesma, E., Stewart, K., Frank, A.U. (eds) Geographic Information Science. GIScience 2014. Lecture Notes in Computer Science, vol 8728. Springer, Cham. https://doi.org/10.1007/978-3-319-11593-1_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-11593-1_1
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11592-4
Online ISBN: 978-3-319-11593-1
eBook Packages: Computer ScienceComputer Science (R0)