Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data
A compound graph is a frequently encountered type of data set. Relations are given between items, and a hierarchy is defined on the items as well. We present a new method for visualizing such compound graphs. Our approach is based on visually bundling the adjacency edges, i.e., non-hierarchical edge...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on visualization and computer graphics 2006-09, Vol.12 (5), p.741-748 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 748 |
|---|---|
| container_issue | 5 |
| container_start_page | 741 |
| container_title | IEEE transactions on visualization and computer graphics |
| container_volume | 12 |
| creator | Holten, D. |
| description | A compound graph is a frequently encountered type of data set. Relations are given between items, and a hierarchy is defined on the items as well. We present a new method for visualizing such compound graphs. Our approach is based on visually bundling the adjacency edges, i.e., non-hierarchical edges, together. We realize this as follows. We assume that the hierarchy is shown via a standard tree visualization method. Next, we bend each adjacency edge, modeled as a B-spline curve, toward the polyline defined by the path via the inclusion edges from one node to another. This hierarchical bundling reduces visual clutter and also visualizes implicit adjacency edges between parent nodes that are the result of explicit adjacency edges between their respective child nodes. Furthermore, hierarchical edge bundling is a generic method which can be used in conjunction with existing tree visualization techniques. We illustrate our technique by providing example visualizations and discuss the results based on an informal evaluation provided by potential users of such visualizations |
| doi_str_mv | 10.1109/TVCG.2006.147 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_865236410</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4015425</ieee_id><sourcerecordid>2340923891</sourcerecordid><originalsourceid>FETCH-LOGICAL-c370t-d7aea42a4db5d19979bfbe5576dde81c22ab522ffdd9e516bbc80bb1e912c90b3</originalsourceid><addsrcrecordid>eNp90ctr3DAQBnBREppXjz0FgukhPXk7o9XD6i3dPCFQCNtchR7jVIvXTqz1If3r680uDekhJw2aHx8MH2OfESaIYL7N72dXEw6gJij0B7aPRmAJEtTOOIPWJVdc7bGDnBcAKERlPrI91FCBNnKfza8T9a4Pv1NwTXERH6j4MbSxofy9uE95cE3641apa4uuLs7iwgVqw3NxR83Lby5SW7yJOHcrd8R2a9dk-rR9D9mvy4v57Lq8_Xl1Mzu7LcNUw6qM2pET3InoZURjtPG1Jym1ipEqDJw7Lzmv6xgNSVTehwq8RzLIgwE_PWRfN7mPffc0UF7ZZcqBmsa11A3ZVkZxzoVSozx9V6oKUXLUI_zyH1x0Q9-OV9hKST5VAmFE5QaFvsu5p9o-9mnp-meLYNet2HUrdt2KHVsZ_ck2dPBLiq96W8MIjjcgEdG_tQCUgsvpX-snkD8</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>865236410</pqid></control><display><type>article</type><title>Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data</title><source>IEEE Electronic Library (IEL)</source><creator>Holten, D.</creator><creatorcontrib>Holten, D.</creatorcontrib><description>A compound graph is a frequently encountered type of data set. Relations are given between items, and a hierarchy is defined on the items as well. We present a new method for visualizing such compound graphs. Our approach is based on visually bundling the adjacency edges, i.e., non-hierarchical edges, together. We realize this as follows. We assume that the hierarchy is shown via a standard tree visualization method. Next, we bend each adjacency edge, modeled as a B-spline curve, toward the polyline defined by the path via the inclusion edges from one node to another. This hierarchical bundling reduces visual clutter and also visualizes implicit adjacency edges between parent nodes that are the result of explicit adjacency edges between their respective child nodes. Furthermore, hierarchical edge bundling is a generic method which can be used in conjunction with existing tree visualization techniques. We illustrate our technique by providing example visualizations and discuss the results based on an informal evaluation provided by potential users of such visualizations</description><identifier>ISSN: 1077-2626</identifier><identifier>EISSN: 1941-0506</identifier><identifier>DOI: 10.1109/TVCG.2006.147</identifier><identifier>PMID: 17080795</identifier><identifier>CODEN: ITVGEA</identifier><language>eng</language><publisher>United States: IEEE</publisher><subject>Bundling ; Cables ; Clutter ; curves ; Data visualization ; Displays ; edge aggregation ; edge bundling ; edge concentration ; graph visualization ; Graphs ; Hierarchies ; Mathematical models ; Network visualization ; node-link diagrams ; Social network services ; Software systems ; Spline ; Tree data structures ; Tree graphs ; tree visualization ; treemaps ; Trees ; Visual ; Visualization ; Wires</subject><ispartof>IEEE transactions on visualization and computer graphics, 2006-09, Vol.12 (5), p.741-748</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2006</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c370t-d7aea42a4db5d19979bfbe5576dde81c22ab522ffdd9e516bbc80bb1e912c90b3</citedby><cites>FETCH-LOGICAL-c370t-d7aea42a4db5d19979bfbe5576dde81c22ab522ffdd9e516bbc80bb1e912c90b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4015425$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4015425$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/17080795$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><creatorcontrib>Holten, D.</creatorcontrib><title>Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data</title><title>IEEE transactions on visualization and computer graphics</title><addtitle>TVCG</addtitle><addtitle>IEEE Trans Vis Comput Graph</addtitle><description>A compound graph is a frequently encountered type of data set. Relations are given between items, and a hierarchy is defined on the items as well. We present a new method for visualizing such compound graphs. Our approach is based on visually bundling the adjacency edges, i.e., non-hierarchical edges, together. We realize this as follows. We assume that the hierarchy is shown via a standard tree visualization method. Next, we bend each adjacency edge, modeled as a B-spline curve, toward the polyline defined by the path via the inclusion edges from one node to another. This hierarchical bundling reduces visual clutter and also visualizes implicit adjacency edges between parent nodes that are the result of explicit adjacency edges between their respective child nodes. Furthermore, hierarchical edge bundling is a generic method which can be used in conjunction with existing tree visualization techniques. We illustrate our technique by providing example visualizations and discuss the results based on an informal evaluation provided by potential users of such visualizations</description><subject>Bundling</subject><subject>Cables</subject><subject>Clutter</subject><subject>curves</subject><subject>Data visualization</subject><subject>Displays</subject><subject>edge aggregation</subject><subject>edge bundling</subject><subject>edge concentration</subject><subject>graph visualization</subject><subject>Graphs</subject><subject>Hierarchies</subject><subject>Mathematical models</subject><subject>Network visualization</subject><subject>node-link diagrams</subject><subject>Social network services</subject><subject>Software systems</subject><subject>Spline</subject><subject>Tree data structures</subject><subject>Tree graphs</subject><subject>tree visualization</subject><subject>treemaps</subject><subject>Trees</subject><subject>Visual</subject><subject>Visualization</subject><subject>Wires</subject><issn>1077-2626</issn><issn>1941-0506</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp90ctr3DAQBnBREppXjz0FgukhPXk7o9XD6i3dPCFQCNtchR7jVIvXTqz1If3r680uDekhJw2aHx8MH2OfESaIYL7N72dXEw6gJij0B7aPRmAJEtTOOIPWJVdc7bGDnBcAKERlPrI91FCBNnKfza8T9a4Pv1NwTXERH6j4MbSxofy9uE95cE3641apa4uuLs7iwgVqw3NxR83Lby5SW7yJOHcrd8R2a9dk-rR9D9mvy4v57Lq8_Xl1Mzu7LcNUw6qM2pET3InoZURjtPG1Jym1ipEqDJw7Lzmv6xgNSVTehwq8RzLIgwE_PWRfN7mPffc0UF7ZZcqBmsa11A3ZVkZxzoVSozx9V6oKUXLUI_zyH1x0Q9-OV9hKST5VAmFE5QaFvsu5p9o-9mnp-meLYNet2HUrdt2KHVsZ_ck2dPBLiq96W8MIjjcgEdG_tQCUgsvpX-snkD8</recordid><startdate>20060901</startdate><enddate>20060901</enddate><creator>Holten, D.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>7X8</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20060901</creationdate><title>Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data</title><author>Holten, D.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c370t-d7aea42a4db5d19979bfbe5576dde81c22ab522ffdd9e516bbc80bb1e912c90b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Bundling</topic><topic>Cables</topic><topic>Clutter</topic><topic>curves</topic><topic>Data visualization</topic><topic>Displays</topic><topic>edge aggregation</topic><topic>edge bundling</topic><topic>edge concentration</topic><topic>graph visualization</topic><topic>Graphs</topic><topic>Hierarchies</topic><topic>Mathematical models</topic><topic>Network visualization</topic><topic>node-link diagrams</topic><topic>Social network services</topic><topic>Software systems</topic><topic>Spline</topic><topic>Tree data structures</topic><topic>Tree graphs</topic><topic>tree visualization</topic><topic>treemaps</topic><topic>Trees</topic><topic>Visual</topic><topic>Visualization</topic><topic>Wires</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Holten, D.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>PubMed</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>MEDLINE - Academic</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on visualization and computer graphics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Holten, D.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data</atitle><jtitle>IEEE transactions on visualization and computer graphics</jtitle><stitle>TVCG</stitle><addtitle>IEEE Trans Vis Comput Graph</addtitle><date>2006-09-01</date><risdate>2006</risdate><volume>12</volume><issue>5</issue><spage>741</spage><epage>748</epage><pages>741-748</pages><issn>1077-2626</issn><eissn>1941-0506</eissn><coden>ITVGEA</coden><abstract>A compound graph is a frequently encountered type of data set. Relations are given between items, and a hierarchy is defined on the items as well. We present a new method for visualizing such compound graphs. Our approach is based on visually bundling the adjacency edges, i.e., non-hierarchical edges, together. We realize this as follows. We assume that the hierarchy is shown via a standard tree visualization method. Next, we bend each adjacency edge, modeled as a B-spline curve, toward the polyline defined by the path via the inclusion edges from one node to another. This hierarchical bundling reduces visual clutter and also visualizes implicit adjacency edges between parent nodes that are the result of explicit adjacency edges between their respective child nodes. Furthermore, hierarchical edge bundling is a generic method which can be used in conjunction with existing tree visualization techniques. We illustrate our technique by providing example visualizations and discuss the results based on an informal evaluation provided by potential users of such visualizations</abstract><cop>United States</cop><pub>IEEE</pub><pmid>17080795</pmid><doi>10.1109/TVCG.2006.147</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1077-2626 |
| ispartof | IEEE transactions on visualization and computer graphics, 2006-09, Vol.12 (5), p.741-748 |
| issn | 1077-2626 1941-0506 |
| language | eng |
| recordid | cdi_proquest_journals_865236410 |
| source | IEEE Electronic Library (IEL) |
| subjects | Bundling Cables Clutter curves Data visualization Displays edge aggregation edge bundling edge concentration graph visualization Graphs Hierarchies Mathematical models Network visualization node-link diagrams Social network services Software systems Spline Tree data structures Tree graphs tree visualization treemaps Trees Visual Visualization Wires |
| title | Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-01T15%3A38%3A20IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Hierarchical%20Edge%20Bundles:%20Visualization%20of%20Adjacency%20Relations%20in%20Hierarchical%20Data&rft.jtitle=IEEE%20transactions%20on%20visualization%20and%20computer%20graphics&rft.au=Holten,%20D.&rft.date=2006-09-01&rft.volume=12&rft.issue=5&rft.spage=741&rft.epage=748&rft.pages=741-748&rft.issn=1077-2626&rft.eissn=1941-0506&rft.coden=ITVGEA&rft_id=info:doi/10.1109/TVCG.2006.147&rft_dat=%3Cproquest_RIE%3E2340923891%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=865236410&rft_id=info:pmid/17080795&rft_ieee_id=4015425&rfr_iscdi=true |