436 search results - page 24 / 88 » Lombardi Drawings of Graphs |
104
click to vote
CCCG
2004
15 years 3 months ago
2004
We consider three-dimensional grid-drawings of graphs with at most one bend per edge. Under the additional requirement that the vertices be collinear, we prove that the minimum vo...
123
click to vote
CCCG
2007
15 years 3 months ago
2007
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend during the course of the morph. The morph uses a polynomial ...
113
Voted
COCOON
2003
Springer
15 years 7 months ago
2003
Springer
The spectral approach for graph visualization computes the layout of a graph using certain eigenvectors of related matrices. Some important advantages of this approach are an abili...
100
Voted
UIST
1997
ACM
15 years 6 months ago
1997
ACM
The GLIDE system is an interactive constraint-based editor for drawing small- and medium-sized graphs (50 nodes or fewer) that organizes the interaction in a more collaborative ma...
103
click to vote
ISAAC
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. We study the two-layer planarization problems that have applications in Automatic Graph Drawing. We are searching for a two-layer planar subgraph of maximumweight in a gi...