11 citations · 11 across the 4 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2019
Drawing planar graphs with few segments on a polynomial grid
Philipp Kindermann, Tamara Mchedlidze, Thomas Schneck +1
The visual complexity of a graph drawing can be measured by the number of geometric objects used for the representation of its elements. In this paper, we study planar graph drawin…
cs.CG2017★ 11 cited
1-Fan-Bundle-Planar Drawings of Graphs
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann +2
Edge bundling is an important concept heavily used for graph visualization purposes. To enable the comparison with other established near-planarity models in graph drawing, we form…