219 search results - page 21 / 44 » Drawing with Fat Edges |
WADS
2007
Springer
14 years 1 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 ...
GD
1997
Springer
13 years 11 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...
CORR
2004
Springer
13 years 7 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...
SOFSEM
2005
Springer
14 years 29 days 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...
GD
2003
Springer
14 years 21 days 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...