326 search results - page 5 / 66 » A Library of Algorithms for Graph Drawing |
ISAAC
2005
Springer
14 years 26 days ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
GD
2006
Springer
13 years 11 months ago
2006
Springer
We consider the problem of intersection-free planar graph morphing, and in particular, a generalization from Euclidean space to spherical space. We show that there exists a continu...
IV
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects ha...
CONSTRAINTS
1998
13 years 7 months ago
1998
Graphs are widely used for information visualization purposes, since they provide a natural and intuitive tation of complex abstract structures. The automatic generation of drawing...
CCCG
2007
13 years 8 months ago
2007
We show an algorithm for constructing O(dn log n) area outerplanar straight-line drawings of n-vertex outerplanar graphs with degree d. Also, we settle in the negative a conjectur...