Linear cartograms visualize travel times between locations, usually by deforming the underlying map such that Euclidean distance corresponds to travel time. We introduce an alternative model, where the map and the locations remain fixed, but edges are drawn as sinusoid curves. Now the travel time over a road corresponds to the length of the curve. Of course the curves might intersect if not placed carefully. We study the corresponding algorithmic problem and show that suitable placements can be computed efficiently. However, the problem of placing as many curves as possible in an ideal, centered position is NP-hard. We introduce three heuristics to optimize the number of centered curves and show how to create animated visualizations.
|Naam||Lecture Notes in Computer Science|
|ISSN van geprinte versie||0302-9743|
|Congres||conference; Eighth International Conference on Geographic Information Science|
|Verkorte titel||GIScience' 14|
|Periode||24/09/14 → 26/09/14|
|Ander||Eighth International Conference on Geographic Information Science|