Drawing with Fat Edges
Duncan, Christian A. and Efrat, Alon and Kobourov, Stephen G. and Wenk, Carola (2002) Drawing with Fat Edges. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 162-177 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_14).
Full text not available from this repository.
In this paper, we introduce the problem of drawing with "fat" edges. Traditionally, graph drawing algorithms represent vertices as circles and edges as closed curves connecting the vertices. In this paper we consider the problem of drawing graphs with edges of variable thickness. The thickness of an edge is often used as a visualization cue, to indicate importance, or to convey some additional information. We present a model for drawing with fat edges and a corresponding polynomial time algorithm that uses the model. We focus on a restricted class of graphs that occur in VLSI wire routing and show how to extend the algorithm to general planar graphs. We show how to take an arbitrary wire routing and convert it into a homotopic equivalent routing such that the distance between any two wires is maximized. Moreover, the routing uses the minimum length wires. Maximizing the distance between wires is equivalent to finding the drawing in which the edges are drawn as thick as possible. To the best of our knowledge this is the first algorithm that finds the maximal distance between any two wires and allows for wires of variable thickness. The previous best known result for the corresponding decision problem with unit wire thickness is the algorithm of Gao et al., which runs in $O(kn^2\log (kn))$ time and uses $O(kn^2)$ space, where $n$ is the number of wires and $k$ is the maximum of the input and output complexities. The running time of our algorithm is $O(kn+n^3)$ and the space required is $O(k+n)$. The algorithm generalizes naturally to general planar graphs as well.
Repository Staff Only: item control page