Sciweavers

436 search results - page 36 / 88
» Lombardi Drawings of Graphs
Sort
View
ISAAC
2007
Springer
124views Algorithms» more  ISAAC 2007»
14 years 3 months ago
Approximating the Crossing Number of Toroidal Graphs
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
Petr Hlinený, Gelasio Salazar
IV
2003
IEEE
92views Visualization» more  IV 2003»
14 years 3 months ago
Visualizing Weighted Edges in Graphs
This paper introduces a new edge length heuristic that finds a graph layout where the edge lengths are proportional to the weights on the graph edges. The heuristic can be used in...
Peter Rodgers, Paul Mutton
JDA
2006
98views more  JDA 2006»
13 years 9 months ago
Completely connected clustered graphs
Abstract. Planar drawings of clustered graphs are considered. We introduce the notion of completely connected clustered graphs, i.e. hierarchically clustered graphs that have the p...
Sabine Cornelsen, Dorothea Wagner
GD
2005
Springer
14 years 3 months ago
Hierarchical Layouts of Directed Graphs in Three Dimensions
Abstract. We introduce a new graph drawing convention for 3D hierarchical drawings of directed graphs. The vertex set is partitioned into layers of vertices drawn in parallel plane...
Seok-Hee Hong, Nikola S. Nikolov
IV
2002
IEEE
130views Visualization» more  IV 2002»
14 years 2 months ago
Spring Embedder Preprocessing for WWW Visualization
We present a preprocessor for the spring embedder graph drawing method and show its use in speeding up the automatic layout of three-dimensional visualizations of WWW sites. Sprin...
Paul Mutton, Peter Rodgers