Sciweavers

712 search results - page 29 / 143
» On Spectral Graph Drawing
Sort
View
CCCG
2007
13 years 9 months ago
Morphing Planar Graph Drawings
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 ...
Anna Lubiw
UIST
1997
ACM
13 years 11 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»
13 years 11 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
13 years 8 months 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»
13 years 7 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