Travel-Time Maps: Linear Cartograms with Fixed Vertex Locations

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.

[1]  David Eppstein,et al.  Lombardi Drawings of Graphs , 2010, J. Graph Algorithms Appl..

[2]  Marc J. van Kreveld,et al.  Labeling a Rectilinear Map More Efficiently , 1999, Inf. Process. Lett..

[3]  Bettina Speckmann,et al.  Visual Encoding of Dissimilarity Data via Topology-Preserving Map Deformation , 2016, IEEE Transactions on Visualization and Computer Graphics.

[4]  Alexei Pozdnoukhov,et al.  User-Centric Time-Distance Representation of Road Networks , 2010, GIScience.

[5]  Michael T. Goodrich,et al.  A Framework for Drawing Planar Graphs with Curves and Polylines , 1998, Graph Drawing.

[6]  Marc J. van Kreveld,et al.  Time-Space Maps from Triangulations , 2012, GD.

[7]  Michael T. Goodrich,et al.  Drawing Planar Graphs with Large Vertices and Thick Edges , 2004, J. Graph Algorithms Appl..

[8]  Eric Saux,et al.  Data reduction of polygonal curves using B-splines , 1999, Comput. Aided Des..

[9]  Eihan Shimizu,et al.  A new algorithm for distance cartogram construction , 2009, Int. J. Geogr. Inf. Sci..

[10]  D. R. Montello,et al.  The Distance–Similarity Metaphor in Network-Display Spatializations , 2004 .

[11]  Mario A. Gomarasca,et al.  Elements of Cartography , 2009 .

[12]  Stephen G. Kobourov,et al.  Fixed-Location Circular Arc Drawing of Planar Graphs , 2007, J. Graph Algorithms Appl..

[13]  Leonidas J. Guibas,et al.  Approximating Polygons and Subdivisions with Minimum Link Paths , 1991, Int. J. Comput. Geom. Appl..

[14]  Inanç Birol,et al.  ABySS-Explorer: Visualizing Genome Sequence Assemblies , 2009, IEEE Transactions on Visualization and Computer Graphics.

[15]  Patrice Langlois,et al.  Cartographie en anamorphose , 1996 .

[16]  Binhai Zhu,et al.  A polynomial time solution for labeling a rectilinear map , 1997, SCG '97.

[17]  Joseph O'Rourke,et al.  Handbook of Discrete and Computational Geometry, Second Edition , 1997 .

[18]  Günter Rote,et al.  Planar Embeddings of Graphs with Specified Edge Lengths , 2003, Graph Drawing.

[19]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..