Preserving Order during Crossing Minimization in Sugiyama Layouts

Sören Domrös, Reinhard Von Hanxleden

2022

Abstract

The Sugiyama algorithm, also known as the layered algorithm or hierarchical algorithm, is an established algorithm to produce crossing-minimal drawings of graphs. It does not, however, consider an initial order of the vertices and edges. We show how ordering real vertices, dummy vertices, and edge ports before crossing minimization may preserve the initial order given by the graph without compromising, on average, the quality of the drawing regarding edge crossings. Even for solutions in which the initial graph order produces more crossings than necessary or the vertex and edge order is conflicting, the proposed approach can produce better crossing-minimal drawings than the traditional approach.

Download


Paper Citation


in Harvard Style

Domrös S. and Von Hanxleden R. (2022). Preserving Order during Crossing Minimization in Sugiyama Layouts. In Proceedings of the 17th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications - Volume 3: IVAPP, ISBN 978-989-758-555-5, pages 156-163. DOI: 10.5220/0010833800003124


in Bibtex Style

@conference{ivapp22,
author={Sören Domrös and Reinhard Von Hanxleden},
title={Preserving Order during Crossing Minimization in Sugiyama Layouts},
booktitle={Proceedings of the 17th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications - Volume 3: IVAPP,},
year={2022},
pages={156-163},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0010833800003124},
isbn={978-989-758-555-5},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 17th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications - Volume 3: IVAPP,
TI - Preserving Order during Crossing Minimization in Sugiyama Layouts
SN - 978-989-758-555-5
AU - Domrös S.
AU - Von Hanxleden R.
PY - 2022
SP - 156
EP - 163
DO - 10.5220/0010833800003124