Graph Bundling by Kernel Density Estimation
We present a fast and simple method to compute bundled layouts of general graphs. For this, we first transform a given graph drawing into a density map using kernel density estimation. Next, we apply an image sharpening technique which progressively merges local height maxima by moving the convolved...
Gespeichert in:
| Veröffentlicht in: | Computer graphics forum 2012-06, Vol.31 (3pt1), p.865-874 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 874 |
|---|---|
| container_issue | 3pt1 |
| container_start_page | 865 |
| container_title | Computer graphics forum |
| container_volume | 31 |
| creator | Hurter, C. Ersoy, O. Telea, A. |
| description | We present a fast and simple method to compute bundled layouts of general graphs. For this, we first transform a given graph drawing into a density map using kernel density estimation. Next, we apply an image sharpening technique which progressively merges local height maxima by moving the convolved graph edges into the height gradient flow. Our technique can be easily and efficiently implemented using standard graphics acceleration techniques and produces graph bundlings of similar appearance and quality to state‐of‐the‐art methods at a fraction of the cost. Additionally, we show how to create bundled layouts constrained by obstacles and use shading to convey information on the bundling quality. We demonstrate our method on several large graphs. |
| doi_str_mv | 10.1111/j.1467-8659.2012.03079.x |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_hal_p</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_01022472v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2695370761</sourcerecordid><originalsourceid>FETCH-LOGICAL-c4639-4015fc8793d54960215c88973262cf2a6aad8896ba850203d32a20aac1930d3a3</originalsourceid><addsrcrecordid>eNqNkEFPwyAUx4nRxDn9Dk08GdP6gALl4EHn1hkX9TDj8QXbTjtrO6HT7dtLrdlZLjzg_3uP_AgJKETUr4tlRGOpwkQKHTGgLAIOSkebPTLYPeyTAVBfKxDikBw5twSAWEkxIOepNau34Hpd51VZvwYv2-CusHVRBTdF7cp2G4xdW36YtmzqY3KwMJUrTv72IXmajOejaTh7SG9HV7MwiyXXYQxULLJEaZ6LWEtgVGRJohVnkmULZqQxuT_LF5MIYMBzzgwDYzKqOeTc8CE56_u-mQpX1k-3W2xMidOrGXZ3QIGxWLEv6rOnfXZlm8914VpcNmtb---hD1GdCD_Ep5I-ldnGOVssdm0pYKcRl9jZws4WdhrxVyNuPHrZo99lVWz_zeEonXSV58OeL11bbHa8se8oFVcCn-9ThOc56On8ETX_AUpHg7g</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1021985850</pqid></control><display><type>article</type><title>Graph Bundling by Kernel Density Estimation</title><source>Wiley Online Library</source><source>EBSCOhost Business Source Complete</source><creator>Hurter, C. ; Ersoy, O. ; Telea, A.</creator><creatorcontrib>Hurter, C. ; Ersoy, O. ; Telea, A.</creatorcontrib><description>We present a fast and simple method to compute bundled layouts of general graphs. For this, we first transform a given graph drawing into a density map using kernel density estimation. Next, we apply an image sharpening technique which progressively merges local height maxima by moving the convolved graph edges into the height gradient flow. Our technique can be easily and efficiently implemented using standard graphics acceleration techniques and produces graph bundlings of similar appearance and quality to state‐of‐the‐art methods at a fraction of the cost. Additionally, we show how to create bundled layouts constrained by obstacles and use shading to convey information on the bundling quality. We demonstrate our method on several large graphs.</description><identifier>ISSN: 0167-7055</identifier><identifier>EISSN: 1467-8659</identifier><identifier>DOI: 10.1111/j.1467-8659.2012.03079.x</identifier><language>eng</language><publisher>Oxford, UK: Blackwell Publishing Ltd</publisher><subject>Analysis ; Computer graphics ; Computer Science ; edge bundles ; Graph layouts ; Graph theory ; Human-Computer Interaction ; I.3.3 [Computer Graphics]: Picture/Image Generation-Line and curve generation ; image-based information visualization ; Studies</subject><ispartof>Computer graphics forum, 2012-06, Vol.31 (3pt1), p.865-874</ispartof><rights>2012 The Author(s) Computer Graphics Forum © 2012 The Eurographics Association and Blackwell Publishing Ltd.</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c4639-4015fc8793d54960215c88973262cf2a6aad8896ba850203d32a20aac1930d3a3</citedby><cites>FETCH-LOGICAL-c4639-4015fc8793d54960215c88973262cf2a6aad8896ba850203d32a20aac1930d3a3</cites><orcidid>0000-0003-4318-6717</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1111%2Fj.1467-8659.2012.03079.x$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1111%2Fj.1467-8659.2012.03079.x$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>230,309,310,314,776,780,785,786,881,1411,23909,23910,25118,27901,27902,45550,45551</link.rule.ids><backlink>$$Uhttps://enac.hal.science/hal-01022472$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Hurter, C.</creatorcontrib><creatorcontrib>Ersoy, O.</creatorcontrib><creatorcontrib>Telea, A.</creatorcontrib><title>Graph Bundling by Kernel Density Estimation</title><title>Computer graphics forum</title><description>We present a fast and simple method to compute bundled layouts of general graphs. For this, we first transform a given graph drawing into a density map using kernel density estimation. Next, we apply an image sharpening technique which progressively merges local height maxima by moving the convolved graph edges into the height gradient flow. Our technique can be easily and efficiently implemented using standard graphics acceleration techniques and produces graph bundlings of similar appearance and quality to state‐of‐the‐art methods at a fraction of the cost. Additionally, we show how to create bundled layouts constrained by obstacles and use shading to convey information on the bundling quality. We demonstrate our method on several large graphs.</description><subject>Analysis</subject><subject>Computer graphics</subject><subject>Computer Science</subject><subject>edge bundles</subject><subject>Graph layouts</subject><subject>Graph theory</subject><subject>Human-Computer Interaction</subject><subject>I.3.3 [Computer Graphics]: Picture/Image Generation-Line and curve generation</subject><subject>image-based information visualization</subject><subject>Studies</subject><issn>0167-7055</issn><issn>1467-8659</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><recordid>eNqNkEFPwyAUx4nRxDn9Dk08GdP6gALl4EHn1hkX9TDj8QXbTjtrO6HT7dtLrdlZLjzg_3uP_AgJKETUr4tlRGOpwkQKHTGgLAIOSkebPTLYPeyTAVBfKxDikBw5twSAWEkxIOepNau34Hpd51VZvwYv2-CusHVRBTdF7cp2G4xdW36YtmzqY3KwMJUrTv72IXmajOejaTh7SG9HV7MwiyXXYQxULLJEaZ6LWEtgVGRJohVnkmULZqQxuT_LF5MIYMBzzgwDYzKqOeTc8CE56_u-mQpX1k-3W2xMidOrGXZ3QIGxWLEv6rOnfXZlm8914VpcNmtb---hD1GdCD_Ep5I-ldnGOVssdm0pYKcRl9jZws4WdhrxVyNuPHrZo99lVWz_zeEonXSV58OeL11bbHa8se8oFVcCn-9ThOc56On8ETX_AUpHg7g</recordid><startdate>201206</startdate><enddate>201206</enddate><creator>Hurter, C.</creator><creator>Ersoy, O.</creator><creator>Telea, A.</creator><general>Blackwell Publishing Ltd</general><general>Wiley</general><scope>BSCLL</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>1XC</scope><scope>VOOES</scope><orcidid>https://orcid.org/0000-0003-4318-6717</orcidid></search><sort><creationdate>201206</creationdate><title>Graph Bundling by Kernel Density Estimation</title><author>Hurter, C. ; Ersoy, O. ; Telea, A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c4639-4015fc8793d54960215c88973262cf2a6aad8896ba850203d32a20aac1930d3a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Analysis</topic><topic>Computer graphics</topic><topic>Computer Science</topic><topic>edge bundles</topic><topic>Graph layouts</topic><topic>Graph theory</topic><topic>Human-Computer Interaction</topic><topic>I.3.3 [Computer Graphics]: Picture/Image Generation-Line and curve generation</topic><topic>image-based information visualization</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hurter, C.</creatorcontrib><creatorcontrib>Ersoy, O.</creatorcontrib><creatorcontrib>Telea, A.</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><collection>Computer and Information Systems 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>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection><jtitle>Computer graphics forum</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hurter, C.</au><au>Ersoy, O.</au><au>Telea, A.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Graph Bundling by Kernel Density Estimation</atitle><jtitle>Computer graphics forum</jtitle><date>2012-06</date><risdate>2012</risdate><volume>31</volume><issue>3pt1</issue><spage>865</spage><epage>874</epage><pages>865-874</pages><issn>0167-7055</issn><eissn>1467-8659</eissn><abstract>We present a fast and simple method to compute bundled layouts of general graphs. For this, we first transform a given graph drawing into a density map using kernel density estimation. Next, we apply an image sharpening technique which progressively merges local height maxima by moving the convolved graph edges into the height gradient flow. Our technique can be easily and efficiently implemented using standard graphics acceleration techniques and produces graph bundlings of similar appearance and quality to state‐of‐the‐art methods at a fraction of the cost. Additionally, we show how to create bundled layouts constrained by obstacles and use shading to convey information on the bundling quality. We demonstrate our method on several large graphs.</abstract><cop>Oxford, UK</cop><pub>Blackwell Publishing Ltd</pub><doi>10.1111/j.1467-8659.2012.03079.x</doi><tpages>10</tpages><orcidid>https://orcid.org/0000-0003-4318-6717</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0167-7055 |
| ispartof | Computer graphics forum, 2012-06, Vol.31 (3pt1), p.865-874 |
| issn | 0167-7055 1467-8659 |
| language | eng |
| recordid | cdi_hal_primary_oai_HAL_hal_01022472v1 |
| source | Wiley Online Library; EBSCOhost Business Source Complete |
| subjects | Analysis Computer graphics Computer Science edge bundles Graph layouts Graph theory Human-Computer Interaction I.3.3 [Computer Graphics]: Picture/Image Generation-Line and curve generation image-based information visualization Studies |
| title | Graph Bundling by Kernel Density Estimation |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-11T19%3A00%3A12IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_hal_p&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Graph%20Bundling%20by%20Kernel%20Density%20Estimation&rft.jtitle=Computer%20graphics%20forum&rft.au=Hurter,%20C.&rft.date=2012-06&rft.volume=31&rft.issue=3pt1&rft.spage=865&rft.epage=874&rft.pages=865-874&rft.issn=0167-7055&rft.eissn=1467-8659&rft_id=info:doi/10.1111/j.1467-8659.2012.03079.x&rft_dat=%3Cproquest_hal_p%3E2695370761%3C/proquest_hal_p%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1021985850&rft_id=info:pmid/&rfr_iscdi=true |