Document Open Access Logo

Determining Sugiyama Topology with Model Order (Poster Abstract)

Authors Sören Domrös , Reinhard von Hanxleden

PDF

File

Thumbnail PDF
PDF
LIPIcs.GD.2024.48.pdf
  • Filesize: 475 kB
  • 3 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Graph algorithms analysis
Keywords
  • Automatic Layout
  • Model Order
  • Layered Layout

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Traditional implementations of the Sugiyama algorithm optimize aesthetic criteria such as the number of backward edges, edge length, or edge crossings. If we, however, utilize the model order, as provided e.g. by a textual graph input file, we can determine the topology of a Sugiyama layout in a one-pass algorithm while controlling the secondary notation and with it the intention expressed by the underlying model, which typically cannot be captured by layout algorithms.

Cite As Get BibTex

Sören Domrös and Reinhard von Hanxleden. Determining Sugiyama Topology with Model Order (Poster Abstract). In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 48:1-48:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.GD.2024.48

Author Details

Sören Domrös
  • Department of Computer Science, Kiel University, Germany
Reinhard von Hanxleden
  • Department of Computer Science, Kiel University, Germany

References

  1. Sören Domrös, Max Riepe, and Reinhard von Hanxleden. Model order in Sugiyama layouts. In Proceedings of the 18th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISIGRAPP 2023) - Volume 3: IVAPP, pages 77-88. INSTICC, SciTePress, 2023. URL: https://doi.org/10.5220/0011656700003417.
  2. Sören Domrös and Reinhard von Hanxleden. Diagram control and model order for sugiyama layouts. In Diagrammatic Representation and Inference, 14th International Conference, DIAGRAMS '24. To be published, 2024. Google Scholar
  3. Peter Eades and David Kelly. Heuristics for reducing crossings in 2-layered networks. Ars Combinatoria, 21:89-98, 1986. Google Scholar
  4. Michael Jünger and Petra Mutzel, editors. Graph Drawing Software. Springer, 2004. URL: https://doi.org/10.1007/978-3-642-18638-7.
  5. Marian Petre. Why looking isn't always seeing: Readership skills and graphical programming. Communications of the ACM, 38(6):33-44, June 1995. URL: https://doi.org/10.1145/203241.203251.
  6. Kozo Sugiyama, Shojiro Tagawa, and Mitsuhiko Toda. Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man and Cybernetics, 11(2):109-125, February 1981. URL: https://doi.org/10.1109/TSMC.1981.4308636.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact