Sciweavers

112 search results - page 7 / 23
» Schematisation of Tree Drawings
Sort
View
GD
1998
Springer
13 years 12 months ago
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
Christian A. Duncan, Michael T. Goodrich, Stephen ...
CORR
2010
Springer
155views Education» more  CORR 2010»
13 years 7 months ago
Drawing Trees with Perfect Angular Resolution and Polynomial Area
We study methods for drawing trees with perfect angular resolution, i.e., with angles at each vertex, v, equal to 2/d(v). We show:
Christian A. Duncan, David Eppstein, Michael T. Go...
GD
1997
Springer
13 years 11 months ago
Minimum-Area h-v Drawings of Complete Binary Trees
Pierluigi Crescenzi, Paolo Penna
ISAAC
1994
Springer
82views Algorithms» more  ISAAC 1994»
13 years 11 months ago
Parallel h-v Drawings of Binary Trees
Panagiotis Takis Metaxas, Grammati E. Pantziou, An...
GD
2006
Springer
13 years 11 months ago
Smoother Transitions Between Breadth-First-Spanning-Tree-Based Drawings
Christopher Homan, Andrew Pavlo, Jonathan Schull