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.
%0 Journal Article
%1 noKey
%A van Dijk, Thomas C.
%A van Goethem, Arthur
%A Haunert, Jan-Henrik
%A Meulemans, Wouter
%A Speckmann, Bettina
%B Geographic Information Science
%D 2014
%E Duckham, Matt
%E Pebesma, Edzer
%E Stewart, Kathleen
%E Frank, AndrewU.
%I Springer International Publishing
%K myown
%P 1-17
%R 10.1007/978-3-319-11593-1_1
%T Map Schematization with Circular Arcs
%U http://dx.doi.org/10.1007/978-3-319-11593-1_1
%V 8728
%X 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.
%@ 978-3-319-11592-4
@article{noKey,
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.},
added-at = {2014-10-14T13:55:43.000+0200},
author = {van Dijk, Thomas C. and van Goethem, Arthur and Haunert, Jan-Henrik and Meulemans, Wouter and Speckmann, Bettina},
biburl = {https://www.bibsonomy.org/bibtex/2122b01833df1ce68af1be8e98ccb4cb5/thomasd},
booktitle = {Geographic Information Science},
doi = {10.1007/978-3-319-11593-1_1},
editor = {Duckham, Matt and Pebesma, Edzer and Stewart, Kathleen and Frank, AndrewU.},
interhash = {7fe087a4eb395d622995972c42077ad7},
intrahash = {122b01833df1ce68af1be8e98ccb4cb5},
isbn = {978-3-319-11592-4},
keywords = {myown},
language = {English},
pages = {1-17},
publisher = {Springer International Publishing},
series = {Lecture Notes in Computer Science},
timestamp = {2014-10-14T14:19:13.000+0200},
title = {Map Schematization with Circular Arcs},
url = {http://dx.doi.org/10.1007/978-3-319-11593-1_1},
volume = 8728,
year = 2014
}