9 search results - page 2 / 2 » A Near-Linear Area Bound for Drawing Binary Trees |
GD
1998
Springer
13 years 9 months ago
1998
Springer
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...
ISBRA
2009
Springer
13 years 11 months ago
2009
Springer
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
INFOVIS
2005
IEEE
13 years 10 months ago
2005
IEEE
We present PRISAD, the first generic rendering infrastructure for information visualization applications that use the accordion drawing technique: rubber-sheet navigation with gu...
DAC
1997
ACM
13 years 9 months ago
1997
ACM
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...