Smashing peacocks further : drawing quasi-trees from biconnected components
Quasi-trees, namely graphs with tree-like structure, appear in many application domains, including bioinformatics and computer networks. Our new SPF approach exploits the structure of these graphs with a two-level approach to drawing, where the graph is decomposed into a tree of biconnected componen...
| Veröffentlicht in: | IEEE transactions on visualization and computer graphics. - 1996. - 12(2006), 5 vom: 11. Sept., Seite 813-20 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | , |
| Format: | Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
2006
|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on visualization and computer graphics |
| Schlagworte: | Journal Article |
| Zusammenfassung: | Quasi-trees, namely graphs with tree-like structure, appear in many application domains, including bioinformatics and computer networks. Our new SPF approach exploits the structure of these graphs with a two-level approach to drawing, where the graph is decomposed into a tree of biconnected components. The low-level biconnected components are drawn with a force-directed approach that uses a spanning tree skeleton as a starting point for the layout. The higher-level structure of the graph is a true tree with meta-nodes of variable size that contain each biconnected component. That tree is drawn with a new area-aware variant of a tree drawing algorithm that handles high-degree nodes gracefully, at the cost of allowing edge-node overlaps. SPF performs an order of magnitude faster than the best previous approaches, while producing drawings of commensurate or improved quality |
|---|---|
| Beschreibung: | Date Completed 12.01.2007 Date Revised 03.11.2006 published: Print Citation Status PubMed-not-MEDLINE |
| ISSN: | 1941-0506 |