45 citations · 69 across the 13 of their papers we have counts for
3 papers · 1 filter
The Bundled Crossing Number
Md. Jawaherul Alam, Martin Fink, Sergey Pupyrev
We study the algorithmic aspect of edge bundling. A bundled crossing in a drawing of a graph is a group of crossings between two sets of parallel edges. The bundled crossing number…
J-Viz: Sibling-First Recursive Graph Drawing for Visualizing Java Bytecode
Md. Jawaherul Alam, Michael T. Goodrich, Timothy Johnson
We describe a graph visualization tool for visualizing Java bytecode. Our tool, which we call J-Viz, visualizes connected directed graphs according to a canonical node ordering, wh…
Capturing Lombardi Flow in Orthogonal Drawings by Minimizing the Number of Segments
Md. Jawaherul Alam, Michael Dillencourt, Michael T. Goodrich
Inspired by the artwork of Mark Lombardi, we study the problem of constructing orthogonal drawings where a small number of horizontal and vertical line segments covers all vertices…