Path router for graph drawing

David P. Dobkin; Eraden R. Gansner; Eleftherios Koutsofios; Stephen C. North

Path router for graph drawing

David P. Dobkin, Eraden R. Gansner, Eleftherios Koutsofios, Stephen C. North

Research output: Contribution to conference › Paper › peer-review

Abstract

A good graph layout can clarify complex relationship among objects. A typical positioning of a node involves placing a label that identifies the object represented by the node. Once the nodes are placed, where edge routings that are easy to read is needed. This involves generating smooth curves that avoid touching unrelated nodes and edges. Two algorithms are animated to solve two cases of the routing problem: the first case is routing within an simple polygon; the second is routing around holes in a polygon.

Original language	English (US)
Pages	415-416
Number of pages	2
State	Published - 1998
Event	Proceedings of the 1998 14th Annual Symposium on Computational Geometry - Minneapolis, MN, USA Duration: Jun 7 1998 → Jun 10 1998

Other

Other	Proceedings of the 1998 14th Annual Symposium on Computational Geometry
City	Minneapolis, MN, USA
Period	6/7/98 → 6/10/98

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Geometry and Topology
Computational Mathematics

Cite this

@conference{ab27f10cb204417591f973ccc7155a12,

title = "Path router for graph drawing",

abstract = "A good graph layout can clarify complex relationship among objects. A typical positioning of a node involves placing a label that identifies the object represented by the node. Once the nodes are placed, where edge routings that are easy to read is needed. This involves generating smooth curves that avoid touching unrelated nodes and edges. Two algorithms are animated to solve two cases of the routing problem: the first case is routing within an simple polygon; the second is routing around holes in a polygon.",

author = "Dobkin, {David P.} and Gansner, {Eraden R.} and Eleftherios Koutsofios and North, {Stephen C.}",

year = "1998",

language = "English (US)",

pages = "415--416",

note = "Proceedings of the 1998 14th Annual Symposium on Computational Geometry ; Conference date: 07-06-1998 Through 10-06-1998",

}

TY - CONF

T1 - Path router for graph drawing

AU - Dobkin, David P.

AU - Gansner, Eraden R.

AU - Koutsofios, Eleftherios

AU - North, Stephen C.

PY - 1998

Y1 - 1998

N2 - A good graph layout can clarify complex relationship among objects. A typical positioning of a node involves placing a label that identifies the object represented by the node. Once the nodes are placed, where edge routings that are easy to read is needed. This involves generating smooth curves that avoid touching unrelated nodes and edges. Two algorithms are animated to solve two cases of the routing problem: the first case is routing within an simple polygon; the second is routing around holes in a polygon.

AB - A good graph layout can clarify complex relationship among objects. A typical positioning of a node involves placing a label that identifies the object represented by the node. Once the nodes are placed, where edge routings that are easy to read is needed. This involves generating smooth curves that avoid touching unrelated nodes and edges. Two algorithms are animated to solve two cases of the routing problem: the first case is routing within an simple polygon; the second is routing around holes in a polygon.

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

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

M3 - Paper

AN - SCOPUS:0031636412

SP - 415

EP - 416

T2 - Proceedings of the 1998 14th Annual Symposium on Computational Geometry

Y2 - 7 June 1998 through 10 June 1998

ER -

Path router for graph drawing

Abstract

Other

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this