Sciweavers

942 search results - page 4 / 189
» Constraints in Graph Drawing Algorithms
Sort
View
GD
2004
Springer
14 years 25 days ago
A Note on the Self-similarity of Some Orthogonal Drawings
Large graphs are difficult to browse and to visually explore. This note adds up evidence that some graph drawing techniques, which produce readable layouts when applied to medium-s...
Maurizio Patrignani
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
ACSC
2004
IEEE
13 years 11 months ago
Flexible Layering in Hierarchical Drawings with Nodes of Arbitrary Size
Graph drawing is an important area of information visualization which concerns itself with the visualization of relational data structures. Relational data like networks, hierarch...
Carsten Friedrich, Falk Schreiber
GD
2006
Springer
13 years 11 months ago
Planarity Testing and Optimal Edge Insertion with Embedding Constraints
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
Carsten Gutwenger, Karsten Klein, Petra Mutzel