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.

Abstract

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.

Item Type:Conference Paper
Additional Information:10.1007/3-540-45848-4_14
Classifications:M Methods > M.600 Planar
P Styles > P.600 Poly-line
ID Code:509

Repository Staff Only: item control page

References

B. Chazelle. A theorem on polygon cutting with applications. In 23th Annual Symposium on Foundations of Computer Sciences, pages 339-349, Los Alamitos, Ca., USA, Nov. 1982. IEEE Computer Society Press.

R. Cole and A. Siegel. River routing every which way, but loose. In 25th Annual Symposium on Foundations of Computer Sciences, pages 65-73, Los Angeles, Ca., USA, Oct. 1984. IEEE Computer Society Press.

D. Dolev, K. Karplus, A. Siegel, A. Strong, and J.D. Ullmann. Optimal wiring between rectangles. In Conference Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computation, pages312-317, Milwaukee, Wisconsin, 11-13 May 1981.

S. Gao, M. Jerrum, M. Kaufmann, K. Mehlhorn, W. Rülling, and C. Storb. On continuous homotopic one layer routing. In Proceedings of the Fourth Annual Symposium on Computational Geometry (Urbana-Champaign, IL, June 6-8, 1988), pages 392-402, New York, 1988. ACM, ACM Press.

Herschberger and Snoeyink. Computing minimum length paths of a given homotopy class. CGTA: Computational Geometry: Theory and Applications, 4, 1994.

M. Kaufmann and K. Mehlhorn. On local routing of two-terminal nets. JCTB: Journal of Combinatorial Theory Series B, 55, 1992.

M. Kaufmann and K. Mehlhorn. Routing through a generalized switchbox. Journal of Algorithms, 7(4):510-531, Dec. 1986.

D.T. Lee and F.P. Preparata. Euclidean shortest paths in the presence of rectilinear barriers. Networks, 14(3):393-410, 1984.

C.E. Leiserson and F.M. Maley. Algorithms for routing and testing routability of planar VLSI layouts. In Proceedings of the Seventeenth Annual ACM Symposium on Theory of computing, pages 69-78, Providence, Rhode Island, 6-8 May, 1985.

C.E. Leiserson and R.Y. Pinter. Optimal placement for river routing. SIAM Journal of Computing, 12(3):447-462, Aug. 1983.

F.M. Maley. Single-layer wire routing. PhD thesis, Massachusetts Institute of Technology, 1987.

A. Mirzaian. River routing in VLSI. Journal of Computer and System Sciences, 34(1):43-54, Feb. 1987.

J. Pach and R. Wenger. Embedding planar graphs with fixed vertex locations. In S. H. Whitesides, editor, Graph Drawing (Proc. GD '98), volume 1547 of Lecture Notes Comput. Sci., pages 263-274. Springer-Verlag, 1998.

R. Pinter River.routing: Methodology and analysis, 1983.

D. Richards. Complexity of single layer routing. IEEE Transactions on Computers, 33:286-288, 1984.

A. Schrijver.Disjoint homotopic paths and trees in a planar graph. Discrete & Computational Geometry, 6, 1991.

A. Schrijver. Edge-disjoint homotopic paths in straight-line planar graphs. SIAM Journal on Discrete Mathematics, 4(1):130-138, Feb. 1991.