Abstract
We use the technique of one-dimensional compaction as part of two new methods tackling problems in the context of automatic diagram layout: First, a post-processing of the layer-based layout algorithm, also known as Sugiyama layout, and second a placement algorithm for connected components with external extensions. We apply our methods to dataflow diagrams from practical applications and find that the first method significantly reduces the width of left-to-right drawn diagrams. The second method allows to properly arrange disconnected graphs that have hierarchy-crossing edges.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Freivalds, K., Dogrusoz, U., Kikusts, P.: Disconnected graph layout and the polyomino packing approach. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 378–391. Springer, Heidelberg (2002)
Frey, P., von Hanxleden, R., Krüger, C., Rüegg, U., Schneider, C., Spönemann, M.: Efficient exploration of complex data flow models. In: Proceedings of Modellierung 2014, Vienna, Austria, March 2014
Friedrich, C., Schreiber, F.: Flexible layering in hierarchical drawings with nodes of arbitrary size. In: Proceedings of the 27th Australasian Conference on Computer Science (ACSC 2004), pp. 369–376. Australian Computer Society Inc. (2004)
Gansner, E.R., Koutsofios, E., North, S.C., Vo, K.-P.: A technique for drawing directed graphs. Softw. Eng. 19(3), 214–230 (1993)
Goehlsdorf, D., Kaufmann, M., Siebenhaller, M.: Placing connected components of disconnected graphs. In: 6th International Asia-Pacific Symposium on Visualization, pp. 101–108, February 2007
Gutwenger, C., von Hanxleden, R., Mutzel, P., Rüegg, U., Spönemann, M.: Examining the compactness of automatic layout algorithms for practical diagrams. In: Proceedings of the Workshop on Graph Visualization in Practice (GraphViP 2014), Melbourne, Australia, July 2014
Healy, P., Nikolov, N.S.: Hierarchical drawing algorithms. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization, pp. 409–453. CRC Press (2013)
Lengauer, T.: Combinatorial Algorithms for Integrated Circuit Layout. Wiley, New York (1990)
Misue, K., Eades, P., Lai, W., Sugiyama, K.: Layout adjustment and the mental map. J. Vis. Lang. Comput. 6(2), 183–210 (1995)
North, S.C., Woodhull, G.: Online hierarchical graph drawing. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 232–246. Springer, Heidelberg (2002)
Ptolemaeus, C. (ed.): System Design, Modeling, and Simulation Using Ptolemy II. Ptolemy.org (2014). http://ptolemy.eecs.berkeley.edu/books/Systems/
Rüegg, U., Schulze, C.D., Grevismühl, D., von Hanxleden, R.: Using one-dimensional compaction for smaller graph drawings. Technical report 1601. Kiel University, Department of Computer Science, April 2016. ISSN: 2192–6247
Schulze, C.D., Spönemann, M., von Hanxleden, R.: Drawing layered graphs with port constraints. J. Vis. Lang. Comput. Spec. Issue Diagram Aesthetics Layout 25(2), 89–106 (2014)
Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man Cybern. 11(2), 109–125 (1981)
Acknowledgements
This work was supported by the German Research Foundation under the project Compact Graph Drawing with Port Constraints (ComDraPor, DFG HA 4407/8-1).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Rüegg, U., Schulze, C.D., Grevismühl, D., von Hanxleden, R. (2016). Using One-Dimensional Compaction for Smaller Graph Drawings. In: Jamnik, M., Uesaka, Y., Elzer Schwartz, S. (eds) Diagrammatic Representation and Inference. Diagrams 2016. Lecture Notes in Computer Science(), vol 9781. Springer, Cham. https://doi.org/10.1007/978-3-319-42333-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-42333-3_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42332-6
Online ISBN: 978-3-319-42333-3
eBook Packages: Computer ScienceComputer Science (R0)