Veröffentlichung

Titel:

1-Fan-Bundle-Planar Drawings of Graphs

AutorInnen:

Patrizio Angelini
Michael A. Bekos
Michael Kaufmann
Philipp Kindermann
Thomas Schneck

Kategorie:

Konferenzbandbeiträge

erschienen in:

Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD'17), pp. 517-530

Abstract:

Edge bundling is an important concept heavily used for graph visualization purposes. To enable the comparison with other established nearly-planarity models in graph drawing, we formulate a new edge-bundling model which is inspired by the recently introduced fan-planar graphs. In particular, we restrict the bundling to the endsegments of the edges. As in 1-planarity, we call our model 1-fan-bundle-planarity, as we allow at most one crossing per bundle.

For the two variants where we allow either one or, more naturally, both endsegments of each edge to be part of bundles, we present edge density results and consider various recognition questions, not only for general graphs, but also for the outer and 2-layer variants. We conclude with a series of challenging questions.

Download:

Springer

BibTeX-Eintrag:

@InProceedings{abkks-1fbpd-gd17, author = {Patrizio Angelini and Michael A. Bekos and Michael Kaufmann and Philipp Kindermann and Thomas Schneck}, title = {1-Fan-Bundle-Planar Drawings of Graphs}, booktitle = {Proc. 25th International Symposium on Graph Drawing and Network Visualization (GD'17)}, year = {2017}, editor = {Fabrizio Frati and Kwan-Liu Ma}, volume = {10692}, series = {LNCS}, pages = {514--530}, publisher = {Springer}, abstract = {Edge bundling is an important concept heavily used for graph visualization purposes. To enable the comparison with other established nearly-planarity models in graph drawing, we formulate a new edge-bundling model which is inspired by the recently introduced fan-planar graphs. In particular, we restrict the bundling to the endsegments of the edges. As in 1-planarity, we call our model \emph{1-fan-bundle-planarity}, as we allow at most one crossing per bundle. For the two variants where we allow either one or, more naturally, both endsegments of each edge to be part of bundles, we present edge density results and consider various recognition questions, not only for general graphs, but also for the outer and 2-layer variants. We conclude with a series of challenging questions.}, doi = {10.1007/978-3-319-73915-1_40}, }