219 search results - page 21 / 44 » Drawing with Fat Edges |
120
Voted
WADS
2007
Springer
15 years 8 months ago
2007
Springer
In this paper we explore, from an algorithmic point of view, the extent to which the facial angles and combinatorial structure of a convex polyhedron determine the polyhedron—in ...
122
Voted
GD
1997
Springer
15 years 6 months ago
1997
Springer
Although routing is a well-studied problem in various contexts, there remain unsolved problems in routing edges for graph layouts. In contrast with techniques from other domains su...
102
click to vote
CORR
2004
Springer
15 years 1 months ago
2004
Springer
A (k, t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between...
136
click to vote
SOFSEM
2005
Springer
15 years 7 months ago
2005
Springer
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...
93
Voted
GD
2003
Springer
15 years 7 months ago
2003
Springer
We propose a method for visualizing a set of related metabolic pathways using 21 2 D graph drawing. Interdependent, twodimensional layouts of each pathway are stacked on top of eac...