Sciweavers

431 search results - page 23 / 87
» Bold Graph Drawings
Sort
View
COCOON
2003
Springer
15 years 4 months ago
On Spectral Graph Drawing
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...
Yehuda Koren
UIST
1997
ACM
15 years 3 months ago
An Interactive Constraint-Based System for Drawing Graphs
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...
Kathy Ryall, Joe Marks, Stuart M. Shieber
ISAAC
1998
Springer
94views Algorithms» more  ISAAC 1998»
15 years 3 months ago
Two-Layer Planarization in Graph Drawing
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...
Petra Mutzel, René Weiskircher
GD
2008
Springer
15 years 1 days ago
The Binary Stress Model for Graph Drawing
We introduce a new force-directed model for computing graph layout. The model bridges the two more popular force directed approaches – the stress and the electrical-spring models...
Yehuda Koren, Ali Civril
CORR
2010
Springer
164views Education» more  CORR 2010»
14 years 11 months ago
Schnyder decompositions for regular plane graphs and application to drawing
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...
Olivier Bernardi, Éric Fusy