GD
2008
Springer
13 years 7 months ago
2008
Springer
In this paper we present a generalization of the shift method algorithm [4, 6] to obtain a straight-line grid drawing of a triconnected graph, where vertex representations have a c...
GD
2008
Springer
13 years 7 months ago
2008
Springer
We present a new network diagram authoring tool, Dunnart, that provides continuous network layout. It continuously adjusts the layout in response to user interaction, while still m...
GD
2008
Springer
13 years 7 months ago
2008
Springer
We consider straight-line drawings of trees on a hexagonal grid. The hexagonal grid is an extension of the common grid with inner nodes of degree six. We restrict the number of dir...
GD
2008
Springer
13 years 7 months ago
2008
Springer
GD
2008
Springer
13 years 7 months ago
2008
Springer
GD
2008
Springer
13 years 7 months ago
2008
Springer
GD
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. Problems in simultaneous graph drawing involve the layout of several graphs on a shared vertex set. This paper describes a Graph Simultaneous Embedding Tool, GraphSET, de...
GD
2008
Springer
13 years 7 months ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...
GD
2008
Springer
13 years 7 months ago
2008
Springer
A visibility representation of a graph G is to represent the nodes of G with non-overlapping horizontal line segments such that the line segments representing any two distinct adja...
GD
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...