%0 Conference Paper %1 abkks-1fbpd-gd17 %A Angelini, Patrizio %A Bekos, Michael A. %A Kaufmann, Michael %A Kindermann, Philipp %A Schneck, Thomas %B Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD'17) %D 2017 %E Frati, Fabrizio %E Ma, Kwan-Liu %I Springer-Verlag %K myown %P 517--530 %R 10.1007/978-3-319-73915-1_40 %T 1-Fan-Bundle-Planar Drawings of Graphs %V 10692 %X 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.

@inproceedings{abkks-1fbpd-gd17, 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.}, added-at = {2017-07-30T22:28:15.000+0200}, arxiv = {https://arxiv.org/abs/1702.06163}, author = {Angelini, Patrizio and Bekos, Michael A. and Kaufmann, Michael and Kindermann, Philipp and Schneck, Thomas}, biburl = {https://www.bibsonomy.org/bibtex/2f2b0135368a5a990f0e06714d79195be/kindermann}, booktitle = {Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD'17)}, doi = {10.1007/978-3-319-73915-1_40}, editor = {Frati, Fabrizio and Ma, Kwan-Liu}, interhash = {03244182c4d036e74b2d26a25227cb15}, intrahash = {f2b0135368a5a990f0e06714d79195be}, keywords = {myown}, month = sep, pages = {517--530}, publisher = {Springer-Verlag}, series = {Lecture Notes in Computer Science}, slides = {http://www1.pub.informatik.uni-wuerzburg.de/pub/kindermann/slides/2017-gd-fanbundles.pdf}, timestamp = {2018-09-18T07:11:55.000+0200}, title = {1-Fan-Bundle-Planar Drawings of Graphs}, volume = 10692, year = 2017 }