Skip to main content
SpringerLink
Log in
Book cover

International Conference on Theory and Application of Diagrams

Diagrams 2016: Diagrammatic Representation and Inference pp 212–218Cite as

Using One-Dimensional Compaction for Smaller Graph Drawings

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9781))

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.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    http://www.eclipse.org/elk.

  2. 2.

    http://www.etas.com/de/products/ehandbook.php.

References

  1. 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)

    Chapter  Google Scholar 

  2. 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

    Google Scholar 

  3. 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)

    Google Scholar 

  4. Gansner, E.R., Koutsofios, E., North, S.C., Vo, K.-P.: A technique for drawing directed graphs. Softw. Eng. 19(3), 214–230 (1993)

    Article  Google Scholar 

  5. 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

    Google Scholar 

  6. 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

    Google Scholar 

  7. Healy, P., Nikolov, N.S.: Hierarchical drawing algorithms. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization, pp. 409–453. CRC Press (2013)

    Google Scholar 

  8. Lengauer, T.: Combinatorial Algorithms for Integrated Circuit Layout. Wiley, New York (1990)

    MATH  Google Scholar 

  9. Misue, K., Eades, P., Lai, W., Sugiyama, K.: Layout adjustment and the mental map. J. Vis. Lang. Comput. 6(2), 183–210 (1995)

    Article  Google Scholar 

  10. 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)

    Chapter  Google Scholar 

  11. Ptolemaeus, C. (ed.): System Design, Modeling, and Simulation Using Ptolemy II. Ptolemy.org (2014). http://ptolemy.eecs.berkeley.edu/books/Systems/

  12. 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

    Google Scholar 

  13. 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)

    Article  Google Scholar 

  14. Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man Cybern. 11(2), 109–125 (1981)

    Article  MathSciNet  Google Scholar 

Download references

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

  1. Deptartment of Computer Science, Kiel University, Kiel, Germany

    Ulf Rüegg, Christoph Daniel Schulze, Daniel Grevismühl & Reinhard von Hanxleden

Authors
  1. Ulf Rüegg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christoph Daniel Schulze
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Daniel Grevismühl
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Reinhard von Hanxleden
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ulf Rüegg .

Editor information

Editors and Affiliations

  1. The University of Cambridge , Cambridge, United Kingdom

    Mateja Jamnik

  2. The University of Tokyo , Tokyo, Japan

    Yuri Uesaka

  3. Millersville University , Millersville, Pennsylvania, USA

    Stephanie Elzer Schwartz

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation