Map schematization with circular arcs

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

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

4 Citaten (Scopus)
246 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.
Originele taal-2Engels
Titel8th International Conference on Geographic Information Science (GIScience)
RedacteurenM. Duckham, E. Pebesma, K. Stewart, A.U. Frank
Plaats van productieBerlin
ISBN van geprinte versie978-3-319-11592-4
StatusGepubliceerd - 2014
Evenementconference; Eighth International Conference on Geographic Information Science - Vienna, Oostenrijk
Duur: 24 sep 201426 sep 2014

Publicatie series

NaamLecture Notes in Computer Science
ISSN van geprinte versie0302-9743


Congresconference; Eighth International Conference on Geographic Information Science
Verkorte titelGIScience' 14
AnderEighth International Conference on Geographic Information Science

Vingerafdruk Duik in de onderzoeksthema's van 'Map schematization with circular arcs'. Samen vormen ze een unieke vingerafdruk.

Citeer dit