Drawing with fat edges

Christian A. Duncan, Alon Efrat, Stephen G Kobourov, Carola Wenk

Research output: Contribution to journalArticle

22 Citations (Scopus)

Abstract

Traditionally, graph drawing algorithms represent vertices as circles and edges as curves connecting the vertices. We introduce the problem of drawing with "fat" edges, i.e., 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 efficient polynomial time algorithm that uses the model. We first focus on a restricted class of graphs that occur in VLSI wire routing and then show how to extend the algorithm to general planar graphs. We show how to convert an arbitrary wire routing into a homotopically equivalent routing that maximizes the distance between any two wires, which is a desired property in VLSI design. Among such, we obtain the routing with minimum total wire length. A homotopically equivalent routing that maximizes the distance between any two wires yields a graph drawing which maximizes edge thickness. Our algorithm does not require unit edge thickness but can be applied as well in the presence of different edge weights.

Original languageEnglish (US)
Pages (from-to)1143-1163
Number of pages21
JournalInternational Journal of Foundations of Computer Science
Volume17
Issue number5
DOIs
StatePublished - Oct 2006

Fingerprint

Drawing (graphics)
Oils and fats
Wire
Visualization
Polynomials

Keywords

  • Continuous homotopic routing
  • Fat edges
  • Graph drawing
  • VLSI wire routing

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Drawing with fat edges. / Duncan, Christian A.; Efrat, Alon; Kobourov, Stephen G; Wenk, Carola.

In: International Journal of Foundations of Computer Science, Vol. 17, No. 5, 10.2006, p. 1143-1163.

Research output: Contribution to journalArticle

Duncan, Christian A. ; Efrat, Alon ; Kobourov, Stephen G ; Wenk, Carola. / Drawing with fat edges. In: International Journal of Foundations of Computer Science. 2006 ; Vol. 17, No. 5. pp. 1143-1163.
@article{da7b165a763740c4b518848cf5d22f9d,
title = "Drawing with fat edges",
abstract = "Traditionally, graph drawing algorithms represent vertices as circles and edges as curves connecting the vertices. We introduce the problem of drawing with {"}fat{"} edges, i.e., 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 efficient polynomial time algorithm that uses the model. We first focus on a restricted class of graphs that occur in VLSI wire routing and then show how to extend the algorithm to general planar graphs. We show how to convert an arbitrary wire routing into a homotopically equivalent routing that maximizes the distance between any two wires, which is a desired property in VLSI design. Among such, we obtain the routing with minimum total wire length. A homotopically equivalent routing that maximizes the distance between any two wires yields a graph drawing which maximizes edge thickness. Our algorithm does not require unit edge thickness but can be applied as well in the presence of different edge weights.",
keywords = "Continuous homotopic routing, Fat edges, Graph drawing, VLSI wire routing",
author = "Duncan, {Christian A.} and Alon Efrat and Kobourov, {Stephen G} and Carola Wenk",
year = "2006",
month = "10",
doi = "10.1142/S0129054106004315",
language = "English (US)",
volume = "17",
pages = "1143--1163",
journal = "International Journal of Foundations of Computer Science",
issn = "0129-0541",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "5",

}

TY - JOUR

T1 - Drawing with fat edges

AU - Duncan, Christian A.

AU - Efrat, Alon

AU - Kobourov, Stephen G

AU - Wenk, Carola

PY - 2006/10

Y1 - 2006/10

N2 - Traditionally, graph drawing algorithms represent vertices as circles and edges as curves connecting the vertices. We introduce the problem of drawing with "fat" edges, i.e., 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 efficient polynomial time algorithm that uses the model. We first focus on a restricted class of graphs that occur in VLSI wire routing and then show how to extend the algorithm to general planar graphs. We show how to convert an arbitrary wire routing into a homotopically equivalent routing that maximizes the distance between any two wires, which is a desired property in VLSI design. Among such, we obtain the routing with minimum total wire length. A homotopically equivalent routing that maximizes the distance between any two wires yields a graph drawing which maximizes edge thickness. Our algorithm does not require unit edge thickness but can be applied as well in the presence of different edge weights.

AB - Traditionally, graph drawing algorithms represent vertices as circles and edges as curves connecting the vertices. We introduce the problem of drawing with "fat" edges, i.e., 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 efficient polynomial time algorithm that uses the model. We first focus on a restricted class of graphs that occur in VLSI wire routing and then show how to extend the algorithm to general planar graphs. We show how to convert an arbitrary wire routing into a homotopically equivalent routing that maximizes the distance between any two wires, which is a desired property in VLSI design. Among such, we obtain the routing with minimum total wire length. A homotopically equivalent routing that maximizes the distance between any two wires yields a graph drawing which maximizes edge thickness. Our algorithm does not require unit edge thickness but can be applied as well in the presence of different edge weights.

KW - Continuous homotopic routing

KW - Fat edges

KW - Graph drawing

KW - VLSI wire routing

UR - http://www.scopus.com/inward/record.url?scp=33748774891&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33748774891&partnerID=8YFLogxK

U2 - 10.1142/S0129054106004315

DO - 10.1142/S0129054106004315

M3 - Article

VL - 17

SP - 1143

EP - 1163

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 5

ER -