23 citations · 158 across the 42 of their papers we have counts for
3 papers · 2 filters
Bundled Crossings Revisited
Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven +3
An effective way to reduce clutter in a graph drawing that has (many) crossings is to group edges that travel in parallel into \emph{bundles}. Each edge can participate in many suc…
Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity
Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar +2
We initiate the study of the following natural geometric optimization problem. The input is a set of axis-aligned rectangles in the plane. The objective is to find a set of horizon…
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends
Steven Chaplick, Fabian Lipp, Alexander Wolff +1
We study the following classes of beyond-planar graphs: 1-planar, IC-planar, and NIC-planar graphs. These are the graphs that admit a 1-planar, IC-planar, and NIC-planar drawing, r…