Sciweavers

436 search results - page 4 / 88
» Lombardi Drawings of Graphs
Sort
View
APVIS
2006
15 years 1 months ago
Method for drawing intersecting clustered graphs and its application to web ontology language
We introduce a class of graphs called an intersecting clustered graph that is a clustered graph with intersections among clusters. We propose a novel method for nicely drawing the...
Hiroki Omote, Kozo Sugiyama
JDA
2010
131views more  JDA 2010»
14 years 10 months ago
Convex drawings of hierarchical planar graphs and clustered planar graphs
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...
Seok-Hee Hong, Hiroshi Nagamochi
DAM
2000
84views more  DAM 2000»
14 years 11 months ago
Three-dimensional orthogonal graph drawing algorithms
We use basic results from graph theory to design algorithms for constructing three-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. ...
Peter Eades, Antonios Symvonis, Sue Whitesides
GD
2004
Springer
15 years 5 months ago
Drawing the AS Graph in 2.5 Dimensions
We propose a method for drawing AS graph data using 2.5D graph visualization. In order to bring out the pure graph structure of the AS graph we consider its core hierarchy. The k-c...
Michael Baur, Ulrik Brandes, Marco Gaertler, Dorot...
ALGORITHMICA
2006
132views more  ALGORITHMICA 2006»
14 years 11 months ago
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clus...
Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Na...