Abstract
We present an algorithm for automatically laying out metro map style schematics using a force-directed approach, where we use a localized version of the standard spring embedder forces combined with an octilinear magnetic force. The two types of forces used during layout are naturally conflicting, and the existing method of simply combining these to generate a resultant force does not give satisfactory results. Hence we vary the forces, emphasizing the standard forces in the beginning to produce a well distributed graph, with the octilinear forces becoming prevalent at the end of the layout, to ensure that the key requirement of line angles at intervals of 45° is obtained. Our method is considerably faster than the more commonly used search-based approaches, and we believe the results are superior to the previous force-directed approach. We have further developed this technique to address the issues of dynamic schematic layout. We use a Delaunay triangulation to construct a schematic “frame”, which is used to retain relative node positions and permits full control of the level of mental map preservation. This technique is the first to combine mental map preservation techniques with the additional layout criteria of schematic diagrams. To conclude, we present the results of a study to investigate the relationship between the level of mental map preservation and the user response time and accuracy.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Stott, J., Rodgers, P.J., Martinez-Ovando, J.C., Walker, S.G.: Automatic Metro Map Layout Using Multicriteria Optimization. TVCG 6, 101–114 (2011)
Anand, S., Avelar, S., Ware, M.J., Jackson, M.: Automated Schematic Map Production using Simulated Annealing and Gradient Descent Approaches. In: 15th Annual GISRUK (2007)
Nöllenburg, M., Wolff, A.: A Mixed-Integer Program for Drawing High-Quality Metro Maps. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 321–333. Springer, Heidelberg (2006)
Merrick, D., Gudmundsson, J.: Path Simplification for Metro Map Layout. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 258–269. Springer, Heidelberg (2007)
Eades, P.: A Heuristic for Graph Drawing. Congressus Numerantium 42, 149–160 (1984)
Sugiyama, K., Misue, K.: A Simple and Unified Method for Drawing Graphs: Magnetic-Spring Algorithm. In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol. 894, pp. 364–375. Springer, Heidelberg (1995)
Hong, S.-H., Merrick, D., Nascimento, H.A.D.: Automatic Visualisation of Metro Maps. IJVLC 17, 203–224 (2006)
Wang, Y.-S., Chi, M.-T.: Focus+Context Metro Maps. TVCG 17, 2528–2535 (2011)
Archembault, D., Purchase, H.C., Pinaud, B.: Animation, Small Multiples, and the Effect of Mental Map Preservation in Dynamic Graphs. TVCG 17, 539–552 (2011)
Purchase, H.C., Samra, A.: Extremes are Better: Investigating Mental Map Preservation in Dynamic Graphs. In: Stapleton, G., Howse, J., Lee, J. (eds.) Diagrams 2008. LNCS (LNAI), vol. 5223, pp. 60–73. Springer, Heidelberg (2008)
Alper, B., Riche, N.H., Ramos, G., Czerwinski, M.: Design Study of LineSets, a Novel Set Visualization Technique. TVCG 17, 2259–2267 (2011)
Purchase, H.C.: Experimental Human-Computer Interaction. Cambridge University Press (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chivers, D., Rodgers, P. (2014). Octilinear Force-Directed Layout with Mental Map Preservation for Schematic Diagrams. In: Dwyer, T., Purchase, H., Delaney, A. (eds) Diagrammatic Representation and Inference. Diagrams 2014. Lecture Notes in Computer Science(), vol 8578. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44043-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-662-44043-8_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44042-1
Online ISBN: 978-3-662-44043-8
eBook Packages: Computer ScienceComputer Science (R0)