The Eclipse Layout Kernel (Software Abstract)

Authors Maximilian Kasperowski , Sören Domrös , Reinhard von Hanxleden



PDF
Thumbnail PDF

File

LIPIcs.GD.2024.56.pdf
  • Filesize: 489 kB
  • 2 pages

Document Identifiers

Author Details

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

Cite AsGet BibTex

Maximilian Kasperowski, Sören Domrös, and Reinhard von Hanxleden. The Eclipse Layout Kernel (Software Abstract). In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 56:1-56:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.GD.2024.56

Abstract

The Eclipse Layout Kernel (ELK) is an open-source framework written in Java, which is transpiled to the JavaScript library elkjs. ELK provides extensible and modular algorithms, visibility for diagramming research, and has an active community. The ELK project is both a validation platform for graph drawing algorithm researchers, and a freely available library put in production use to provide automatic layout for academic and commercial applications. The report [S. Domrös et al., 2023] presents an overview of the available algorithms, the development history, related publications, as well as lessons learned from developing the open-source framework. ELK welcomes new users as well as new contributors.

Subject Classification

ACM Subject Classification
  • Software and its engineering → Software libraries and repositories
Keywords
  • Automatic Layout
  • Layered Layout
  • Layout Library

Metrics

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

References

  1. U. Brandes and B. Köpf. Fast and simple horizontal coordinate assignment. In Proc. GD '01, 2002. URL: https://doi.org/10.1007/3-540-45848-4.
  2. S. Domrös, M. Riepe, and R. von Hanxleden. Model order in Sugiyama layouts. In Proc. VISIGRAPP 2023 - Volume 3: IVAPP, 2023. URL: https://doi.org/10.5220/0011656700003417.
  3. S. Domrös, R. von Hanxleden, M. Spönemann, U. Rüegg, and C. D. Schulze. The Eclipse Layout Kernel, 2023. URL: https://doi.org/10.48550/arXiv.2311.00533.
  4. M. Forster. A fast and simple heuristic for constrained two-level crossing reduction. In Proc. GD '04, 2005. URL: https://doi.org/10.1007/978-3-540-31843-9_22.
  5. A. Jabrayilov, S. Mallach, P. Mutzel, U. Rüegg, and R. von Hanxleden. Compact layered drawings of general directed graphs. In Proc. GD '16, 2016. URL: https://doi.org/10.1007/978-3-319-50106-2.
  6. M. Kasperowski and R. von Hanxleden. Top-down drawings of compound graphs, December 2023. URL: https://doi.org/10.48550/arXiv.2312.07319.
  7. U. Rüegg, T. Ehlers, M. Spönemann, and R. von Hanxleden. A generalization of the directed graph layering problem. In Proc. GD '16, 2016. URL: https://doi.org/10.1007/978-3-319-50106-2_16.
  8. U. Rüegg, C. D. Schulze, J. J. Carstens, and R. von Hanxleden. Size- and port-aware horizontal node coordinate assignment. In Proc. GD '15, 2015. URL: https://doi.org/10.1007/978-3-319-27261-0_12.
  9. U. Rüegg, C. D. Schulze, C. Sprung, N. Wechselberg, and R. von Hanxleden. Edge bundling for dataflow diagrams. Poster at GD '16, 2016. Google Scholar
  10. M. Spönemann, H. Fuhrmann, R. von Hanxleden, and P. Mutzel. Port constraints in hierarchical layout of data flow diagrams. In Proc. GD '09, 2010. URL: https://doi.org/10.1007/978-3-642-11805-0.
  11. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man. Cybern., 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