Map schematization with circular arcs

T. van Dijk, A.I. van Goethem, J.H. Haunert, W. Meulemans, B. Speckmann

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

12 Citations (Scopus)
441 Downloads (Pure)


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.
Original languageEnglish
Title of host publication8th International Conference on Geographic Information Science (GIScience)
EditorsM. Duckham, E. Pebesma, K. Stewart, A.U. Frank
Place of PublicationBerlin
ISBN (Print)978-3-319-11592-4
Publication statusPublished - 2014
Eventconference; Eighth International Conference on Geographic Information Science - Vienna, Austria
Duration: 24 Sept 201426 Sept 2014

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743


Conferenceconference; Eighth International Conference on Geographic Information Science
Abbreviated titleGIScience' 14
Other8th International Conference, GIScience' 14, Vienna, Austria, September 24-26, 2014.


Dive into the research topics of 'Map schematization with circular arcs'. Together they form a unique fingerprint.

Cite this