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...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on visualization and computer graphics. - 1996. - 12(2006), 5 vom: 11. Sept., Seite 813-20
1. Verfasser: Archambault, Daniel (VerfasserIn)
Weitere Verfasser: Munzner, Tamara, Auber, David
Format: Aufsatz
Sprache:English
Veröffentlicht: 2006
Zugriff auf das übergeordnete Werk:IEEE transactions on visualization and computer graphics
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM166361852
003 DE-627
005 20231223110637.0
007 tu
008 231223s2006 xx ||||| 00| ||eng c
028 5 2 |a pubmed24n0555.xml 
035 |a (DE-627)NLM166361852 
035 |a (NLM)17080804 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Archambault, Daniel  |e verfasserin  |4 aut 
245 1 0 |a Smashing peacocks further  |b drawing quasi-trees from biconnected components 
264 1 |c 2006 
336 |a Text  |b txt  |2 rdacontent 
337 |a ohne Hilfsmittel zu benutzen  |b n  |2 rdamedia 
338 |a Band  |b nc  |2 rdacarrier 
500 |a Date Completed 12.01.2007 
500 |a Date Revised 03.11.2006 
500 |a published: Print 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a 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 
650 4 |a Journal Article 
700 1 |a Munzner, Tamara  |e verfasserin  |4 aut 
700 1 |a Auber, David  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on visualization and computer graphics  |d 1996  |g 12(2006), 5 vom: 11. Sept., Seite 813-20  |w (DE-627)NLM098269445  |x 1941-0506  |7 nnns 
773 1 8 |g volume:12  |g year:2006  |g number:5  |g day:11  |g month:09  |g pages:813-20 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 12  |j 2006  |e 5  |b 11  |c 09  |h 813-20