Force-Directed Edge Bundling for Graph Visualization
Graphs depicted as node‐link diagrams are widely used to show relationships between entities. However, node‐link diagrams comprised of a large number of nodes and edges often suffer from visual clutter. The use of edge bundling remedies this and reveals high‐level edge patterns. Previous methods req...
Uloženo v:
| Vydáno v: | Computer graphics forum Ročník 28; číslo 3; s. 983 - 990 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Oxford, UK
Blackwell Publishing Ltd
01.06.2009
|
| Témata: | |
| ISSN: | 0167-7055, 1467-8659 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Graphs depicted as node‐link diagrams are widely used to show relationships between entities. However, node‐link diagrams comprised of a large number of nodes and edges often suffer from visual clutter. The use of edge bundling remedies this and reveals high‐level edge patterns. Previous methods require the graph to contain a hierarchy for this, or they construct a control mesh to guide the edge bundling process, which often results in bundles that show considerable variation in curvature along the overall bundle direction. We present a new edge bundling method that uses a self‐organizing approach to bundling in which edges are modeled as flexible springs that can attract each other. In contrast to previous methods, no hierarchy is used and no control mesh. The resulting bundled graphs show significant clutter reduction and clearly visible high‐level edge patterns. Curvature variation is furthermore minimized, resulting in smooth bundles that are easy to follow. Finally, we present a rendering technique that can be used to emphasize the bundling. |
|---|---|
| AbstractList | Graphs depicted as node-link diagrams are widely used to show relationships between entities. However, node-link diagrams comprised of a large number of nodes and edges often suffer from visual clutter. The use of edge bundling remedies this and reveals high-level edge patterns. Previous methods require the graph to contain a hierarchy for this, or they construct a control mesh to guide the edge bundling process, which often results in bundles that show considerable variation in curvature along the overall bundle direction. We present a new edge bundling method that uses a self-organizing approach to bundling in which edges are modeled as flexible springs that can attract each other. In contrast to previous methods, no hierarchy is used and no control mesh. The resulting bundled graphs show significant clutter reduction and clearly visible high-level edge patterns. Curvature variation is furthermore minimized, resulting in smooth bundles that are easy to follow. Finally, we present a rendering technique that can be used to emphasize the bundling. [PUBLICATION ABSTRACT] Graphs depicted as node‐link diagrams are widely used to show relationships between entities. However, node‐link diagrams comprised of a large number of nodes and edges often suffer from visual clutter. The use of edge bundling remedies this and reveals high‐level edge patterns. Previous methods require the graph to contain a hierarchy for this, or they construct a control mesh to guide the edge bundling process, which often results in bundles that show considerable variation in curvature along the overall bundle direction. We present a new edge bundling method that uses a self‐organizing approach to bundling in which edges are modeled as flexible springs that can attract each other. In contrast to previous methods, no hierarchy is used and no control mesh. The resulting bundled graphs show significant clutter reduction and clearly visible high‐level edge patterns. Curvature variation is furthermore minimized, resulting in smooth bundles that are easy to follow. Finally, we present a rendering technique that can be used to emphasize the bundling. |
| Author | Van Wijk, Jarke J. Holten, Danny |
| Author_xml | – sequence: 1 givenname: Danny surname: Holten fullname: Holten, Danny organization: Eindhoven University of Technology – sequence: 2 givenname: Jarke J. surname: Van Wijk fullname: Van Wijk, Jarke J. organization: Eindhoven University of Technology |
| BookMark | eNqNkM1O4zAURi3ESBSGd4hYsEu4rv-SBUhQaEBUM9II6PLKdZziEpJiJ6LM00_Sjliwwhtfyd_5rnUOyX7d1JaQiEJC-3O2SiiXKk6lyJIxQJYA5QKSzR4ZfT7skxHQflYgxAE5DGEFAFxJMSJ82nhj42vnrWltEd0USxtddXVRuXoZlY2Pcq_Xz9GTC52u3F_duqb-SX6Uugr2-P99RB6nNw-T23j2O7-bXM5iw5WAuJQgBRSacma2-zKwPKWSytJAIW1RwELBYmHHmtFSSJZJk4KlOmMLJkvOjsjprnftm7fOhhZfXTC2qnRtmy4g44qnbMz64MmX4KrpfN3_DWnGpZBjNrSlu5DxTQjelrj27lX7D6SAg0tc4aAMB2U4uMStS9z06MUX1Lh2q6L12lXfKTjfFby7yn58ezFO8ukw9Xy8411o7eaT1_4FpWJK4PxXjhP-h87vVY4z9g_s6Zx6 |
| CitedBy_id | crossref_primary_10_1177_14738716241255598 crossref_primary_10_1109_TVCG_2015_2467554 crossref_primary_10_1109_TVCG_2020_2985689 crossref_primary_10_1162_netn_a_00044 crossref_primary_10_1038_s41586_023_06767_1 crossref_primary_10_1007_s10784_022_09579_2 crossref_primary_10_1111_cgf_12661 crossref_primary_10_1080_15230406_2020_1745092 crossref_primary_10_1093_comjnl_bxx117 crossref_primary_10_1109_TVCG_2015_2403323 crossref_primary_10_1080_13658816_2023_2190374 crossref_primary_10_1145_3106775 crossref_primary_10_1186_s40638_017_0079_x crossref_primary_10_1016_j_cola_2023_101198 crossref_primary_10_1016_j_cola_2019_100925 crossref_primary_10_1109_TCSS_2018_2877149 crossref_primary_10_1109_TITS_2021_3060576 crossref_primary_10_3390_e20090625 crossref_primary_10_1109_TVCG_2024_3456192 crossref_primary_10_1109_TVCG_2023_3327149 crossref_primary_10_1111_cgf_12778 crossref_primary_10_1109_TVCG_2014_2346271 crossref_primary_10_1007_s00357_019_09315_7 crossref_primary_10_1109_TVCG_2019_2934555 crossref_primary_10_1109_TVCG_2016_2520921 crossref_primary_10_1109_ACCESS_2020_2983052 crossref_primary_10_1177_1473871617738122 crossref_primary_10_1109_TVCG_2015_2467691 crossref_primary_10_1109_TVCG_2016_2598867 crossref_primary_10_1111_cgf_13186 crossref_primary_10_1109_TVCG_2011_233 crossref_primary_10_1162_artl_a_00351 crossref_primary_10_1109_TVCG_2016_2534519 crossref_primary_10_1109_TBDATA_2022_3188660 crossref_primary_10_1109_TVCG_2022_3209477 crossref_primary_10_3390_pathogens12050634 crossref_primary_10_1109_TVCG_2020_2970522 crossref_primary_10_1177_1473871616681375 crossref_primary_10_1016_j_cag_2016_11_001 crossref_primary_10_1007_s12650_018_0522_2 crossref_primary_10_1109_TITS_2017_2711644 crossref_primary_10_1109_TVCG_2018_2864844 crossref_primary_10_1111_tgis_12100 crossref_primary_10_1109_TBDATA_2018_2869165 crossref_primary_10_1109_TVCG_2018_2864843 crossref_primary_10_1016_j_compbiomed_2025_110542 crossref_primary_10_1080_15230406_2018_1437359 crossref_primary_10_1109_TVCG_2017_2744338 crossref_primary_10_1186_s12942_018_0152_x crossref_primary_10_1109_TVCG_2017_2744458 crossref_primary_10_1145_3200764 crossref_primary_10_1016_j_jvlc_2017_09_004 crossref_primary_10_1177_14738716221079589 crossref_primary_10_1111_j_1467_8659_2011_01913_x crossref_primary_10_1177_0117196816686282 crossref_primary_10_1080_17445647_2013_824391 crossref_primary_10_1001_jamanetworkopen_2024_39509 crossref_primary_10_1016_j_neucom_2019_10_072 crossref_primary_10_1109_TVCG_2011_183 crossref_primary_10_1016_j_physa_2015_06_015 crossref_primary_10_1109_TVCG_2016_2598619 crossref_primary_10_1109_TVCG_2013_229 crossref_primary_10_1111_cgf_13178 crossref_primary_10_1016_j_compenvurbsys_2018_03_008 crossref_primary_10_1145_3301281 crossref_primary_10_1109_TVCG_2018_2861397 crossref_primary_10_1007_s00607_013_0285_5 crossref_primary_10_1016_j_asoc_2016_01_036 crossref_primary_10_3390_info9070154 crossref_primary_10_1007_s12650_016_0357_7 crossref_primary_10_1007_s42979_022_01404_6 crossref_primary_10_1109_TCSS_2024_3426659 crossref_primary_10_1109_TVCG_2019_2934802 crossref_primary_10_1109_TVCG_2016_2534559 crossref_primary_10_1109_TVCG_2025_3539779 crossref_primary_10_4018_IJITWE_314571 crossref_primary_10_1109_TVCG_2019_2934805 crossref_primary_10_1007_s12469_018_0183_5 crossref_primary_10_1093_gigascience_gix054 crossref_primary_10_1111_cgf_12881 crossref_primary_10_1016_j_jpsychires_2021_01_041 crossref_primary_10_1371_journal_pone_0146368 crossref_primary_10_1016_j_ins_2019_05_007 crossref_primary_10_1109_TVCG_2016_2598831 crossref_primary_10_1111_cgf_13391 crossref_primary_10_1109_TVCG_2016_2598958 crossref_primary_10_1109_TVCG_2009_167 crossref_primary_10_1186_s40462_015_0032_y crossref_primary_10_1109_MMUL_2018_2873495 crossref_primary_10_1109_TMM_2013_2238521 crossref_primary_10_1111_cgf_13712 crossref_primary_10_1002_sec_521 crossref_primary_10_1007_s10710_018_9328_1 crossref_primary_10_3138_carto_46_4_239 crossref_primary_10_1007_s41651_017_0001_7 crossref_primary_10_1109_TVCG_2020_3030440 crossref_primary_10_1146_annurev_biodatasci_080917_013424 crossref_primary_10_1080_15230406_2021_2011419 crossref_primary_10_1109_TVCG_2016_2515611 crossref_primary_10_1109_TVCG_2024_3388562 crossref_primary_10_1177_1473871619882019 crossref_primary_10_3390_ijgi7060203 crossref_primary_10_1080_15230406_2023_2171490 crossref_primary_10_3389_fnins_2014_00015 crossref_primary_10_1109_TVCG_2015_2468111 crossref_primary_10_1109_TVCG_2009_143 crossref_primary_10_1145_2766936 crossref_primary_10_1109_TVCG_2024_3388553 crossref_primary_10_1108_VJIKMS_08_2021_0169 crossref_primary_10_1109_TVCG_2018_2798631 crossref_primary_10_1177_1473871616630778 crossref_primary_10_1007_s11042_020_09885_4 crossref_primary_10_1080_17445647_2012_753850 crossref_primary_10_1080_17445647_2021_1996479 crossref_primary_10_5194_npg_22_545_2015 crossref_primary_10_1089_big_2014_0023 crossref_primary_10_1109_TVCG_2011_190 crossref_primary_10_1097_MLR_0000000000002182 crossref_primary_10_1002_cpe_3287 crossref_primary_10_3390_app12178405 crossref_primary_10_3390_ijgi8020063 crossref_primary_10_1080_00087041_2022_2097759 crossref_primary_10_1145_3337790 crossref_primary_10_1186_s12859_017_1787_5 crossref_primary_10_1109_TVCG_2013_114 crossref_primary_10_1007_s10707_019_00350_5 crossref_primary_10_1007_s12650_018_0514_2 crossref_primary_10_1080_17445647_2016_1239556 crossref_primary_10_1109_TVCG_2015_2440259 crossref_primary_10_1109_TVCG_2014_2346444 crossref_primary_10_1007_s11042_019_08060_8 crossref_primary_10_1007_s12650_024_01042_5 crossref_primary_10_1007_s11390_013_1383_8 crossref_primary_10_1016_j_jmb_2019_01_044 crossref_primary_10_1038_s41467_019_13625_0 crossref_primary_10_1109_TVCG_2013_246 crossref_primary_10_1007_s00779_017_1091_4 crossref_primary_10_1109_TVCG_2016_2598472 crossref_primary_10_1111_j_1467_8659_2012_03079_x crossref_primary_10_1109_TVCG_2021_3057519 crossref_primary_10_1016_j_procs_2015_08_286 crossref_primary_10_1007_s12650_021_00759_x crossref_primary_10_1016_j_comgeo_2015_10_005 crossref_primary_10_1080_13658816_2020_1863411 crossref_primary_10_1109_TVCG_2019_2953026 crossref_primary_10_1016_j_cag_2019_06_008 crossref_primary_10_1109_TVCG_2023_3326944 crossref_primary_10_1111_cgf_13441 crossref_primary_10_1109_TVCG_2024_3388525 crossref_primary_10_1111_cgf_14417 crossref_primary_10_1109_TVCG_2011_217 crossref_primary_10_1145_3185047 crossref_primary_10_1109_MNET_2012_6375888 crossref_primary_10_1080_00087041_2024_2325191 crossref_primary_10_1109_TVCG_2019_2903956 crossref_primary_10_1109_TVCG_2014_2362543 crossref_primary_10_1007_s11042_017_5441_z crossref_primary_10_1080_24694452_2016_1222263 crossref_primary_10_1017_dsi_2019_309 crossref_primary_10_1111_cgf_13452 crossref_primary_10_1109_TKDE_2024_3387480 crossref_primary_10_1109_TVCG_2011_104 crossref_primary_10_1109_TVCG_2011_226 crossref_primary_10_1111_cgf_13213 crossref_primary_10_1007_s13278_022_00879_8 crossref_primary_10_1109_TVCG_2011_223 crossref_primary_10_1007_s00371_018_1509_7 crossref_primary_10_1111_j_1467_8659_2009_01680_x crossref_primary_10_1080_17445647_2017_1313788 crossref_primary_10_1109_TVCG_2023_3239909 crossref_primary_10_1109_TVCG_2012_238 crossref_primary_10_1109_TVCG_2024_3456321 crossref_primary_10_1109_TSP_2016_2634543 crossref_primary_10_1111_cgf_14198 crossref_primary_10_1109_ACCESS_2018_2872344 crossref_primary_10_1016_j_tcs_2018_03_005 crossref_primary_10_1016_j_lanwpc_2024_101261 crossref_primary_10_1109_TVCG_2023_3326923 crossref_primary_10_1109_TVCG_2013_151 crossref_primary_10_1109_TVCG_2015_2467813 crossref_primary_10_1007_s12650_019_00551_y crossref_primary_10_1109_TVCG_2025_3541571 crossref_primary_10_1016_j_ins_2020_12_069 crossref_primary_10_1177_14738716241239619 crossref_primary_10_1145_2461912_2461980 crossref_primary_10_1109_TVCG_2019_2934657 crossref_primary_10_1108_GKMC_02_2024_0054 crossref_primary_10_1109_TVCG_2021_3114795 crossref_primary_10_1109_TVCG_2011_202 crossref_primary_10_3390_a13110290 crossref_primary_10_1109_TVCG_2013_167 crossref_primary_10_3390_ijgi7010012 crossref_primary_10_1007_s00371_020_01975_6 crossref_primary_10_1007_s00371_013_0892_3 crossref_primary_10_3390_a13110298 crossref_primary_10_1002_pmic_201300167 crossref_primary_10_1109_TBDATA_2016_2586447 crossref_primary_10_1109_TVCG_2025_3567135 |
| Cites_doi | 10.1109/TVCG.2008.135 10.1007/3-540-62495-3_42 10.1038/324446a0 10.1109/TVCG.2007.70580 10.1007/978-3-540-31843-9_25 10.1016/0020-0190(89)90102-6 10.1007/3-540-44969-8 10.1007/978-3-540-70904-6_38 10.1007/978-3-540-70904-6_3 10.1109/2945.841119 10.1002/spe.4380211102 10.1109/TVCG.2006.147 10.1109/PACIFICVIS.2008.4475459 10.1109/2945.468391 10.7155/jgaa.00051 10.1007/978-3-540-70904-6_37 10.1137/S154034590241370X 10.1109/TVCG.2007.70535 10.1007/978-3-540-24595-7_1 |
| ContentType | Journal Article |
| Copyright | 2009 The Author(s) Journal compilation © 2009 The Eurographics Association and Blackwell Publishing Ltd. 2009 The Eurographics Association and Blackwell Publishing Ltd. |
| Copyright_xml | – notice: 2009 The Author(s) Journal compilation © 2009 The Eurographics Association and Blackwell Publishing Ltd. – notice: 2009 The Eurographics Association and Blackwell Publishing Ltd. |
| DBID | BSCLL AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D F28 FR3 |
| DOI | 10.1111/j.1467-8659.2009.01450.x |
| DatabaseName | Istex CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ANTE: Abstracts in New Technology & Engineering Engineering Research Database |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
| DatabaseTitleList | Computer and Information Systems Abstracts Technology Research Database CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1467-8659 |
| EndPage | 990 |
| ExternalDocumentID | 1810708571 10_1111_j_1467_8659_2009_01450_x CGF1450 ark_67375_WNG_C4R1WK7G_L |
| Genre | article Feature |
| GroupedDBID | .3N .4S .DC .GA .Y3 05W 0R~ 10A 15B 1OB 1OC 29F 31~ 33P 3SF 4.4 50Y 50Z 51W 51X 52M 52N 52O 52P 52S 52T 52U 52W 52X 5GY 5HH 5LA 5VS 66C 6J9 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 8VB 930 A03 AAESR AAEVG AAHQN AAMMB AAMNL AANHP AANLZ AAONW AASGY AAXRX AAYCA AAZKR ABCQN ABCUV ABDBF ABDPE ABEML ABPVW ACAHQ ACBWZ ACCZN ACFBH ACGFS ACPOU ACRPL ACSCC ACUHS ACXBN ACXQS ACYXJ ADBBV ADEOM ADIZJ ADKYN ADMGS ADMLS ADNMO ADOZA ADXAS ADZMN AEFGJ AEGXH AEIGN AEIMD AEMOZ AENEX AEUYR AEYWJ AFBPY AFEBI AFFNX AFFPM AFGKR AFWVQ AFZJQ AGHNM AGQPQ AGXDD AGYGG AHBTC AHEFC AHQJS AIDQK AIDYY AIQQE AITYG AIURR AJXKR AKVCP ALAGY ALMA_UNASSIGNED_HOLDINGS ALVPJ AMBMR AMYDB ARCSS ASPBG ATUGU AUFTA AVWKF AZBYB AZFZN AZVAB BAFTC BDRZF BFHJK BHBCM BMNLL BMXJE BNHUX BROTX BRXPI BSCLL BY8 CAG COF CS3 CWDTD D-E D-F DCZOG DPXWK DR2 DRFUL DRSTM DU5 EAD EAP EBA EBO EBR EBS EBU EDO EJD EMK EST ESX F00 F01 F04 F5P FEDTE FZ0 G-S G.N GODZA H.T H.X HF~ HGLYW HVGLF HZI HZ~ I-F IHE IX1 J0M K1G K48 LATKE LC2 LC3 LEEKS LH4 LITHE LOXES LP6 LP7 LUTES LW6 LYRES MEWTI MK4 MRFUL MRSTM MSFUL MSSTM MXFUL MXSTM N04 N05 N9A NF~ O66 O9- OIG P2W P2X P4D PALCI PQQKQ Q.N Q11 QB0 QWB R.K RDJ RIWAO RJQFR ROL RX1 SAMSI SUPJJ TH9 TN5 TUS UB1 V8K W8V W99 WBKPD WIH WIK WOHZO WQJ WXSBR WYISQ WZISG XG1 ZL0 ZZTAW ~IA ~IF ~WT ALUQN AAYXX CITATION O8X 7SC 8FD JQ2 L7M L~C L~D F28 FR3 |
| ID | FETCH-LOGICAL-c4750-f60650da143c0047690e481616fc0d6edd0b70bbe2a31f56396c80e1a93b36f43 |
| IEDL.DBID | DRFUL |
| ISICitedReferencesCount | 355 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000268217500036&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0167-7055 |
| IngestDate | Sun Nov 09 11:34:54 EST 2025 Fri Jul 25 05:25:56 EDT 2025 Tue Nov 18 22:26:16 EST 2025 Sat Nov 29 03:41:03 EST 2025 Sun Sep 21 06:19:33 EDT 2025 Tue Nov 11 03:31:44 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c4750-f60650da143c0047690e481616fc0d6edd0b70bbe2a31f56396c80e1a93b36f43 |
| Notes | ArticleID:CGF1450 istex:3D4AFD5EAEB969A8768F6C69491C16F36E113E35 ark:/67375/WNG-C4R1WK7G-L SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| PQID | 194656234 |
| PQPubID | 30877 |
| PageCount | 8 |
| ParticipantIDs | proquest_miscellaneous_34748323 proquest_journals_194656234 crossref_primary_10_1111_j_1467_8659_2009_01450_x crossref_citationtrail_10_1111_j_1467_8659_2009_01450_x wiley_primary_10_1111_j_1467_8659_2009_01450_x_CGF1450 istex_primary_ark_67375_WNG_C4R1WK7G_L |
| PublicationCentury | 2000 |
| PublicationDate | June 2009 |
| PublicationDateYYYYMMDD | 2009-06-01 |
| PublicationDate_xml | – month: 06 year: 2009 text: June 2009 |
| PublicationDecade | 2000 |
| PublicationPlace | Oxford, UK |
| PublicationPlace_xml | – name: Oxford, UK – name: Oxford |
| PublicationTitle | Computer graphics forum |
| PublicationYear | 2009 |
| Publisher | Blackwell Publishing Ltd |
| Publisher_xml | – name: Blackwell Publishing Ltd |
| References | Cui W., Zhou H., Qu H., Wong P. C., Li X.: Geometry-Based Edge Clustering for Graph Visualization. IEEE Transactions on Visualization and Computer Graphics (Proc. of INFOVIS'08) 14, 6 (2008), 1277-1284. Fruchterman T. M. J., Reingold E. M.: Graph Drawing by Force-Directed Placement. Software - Practice and Experience 21, 11 (1991), 1129-1164. Battista G. D., Eades P., Tamassia R., Tol-Lis I. G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1999. Ellis G., Dix A.: A Taxonomy of Clutter Reduction for Information Visualisation. IEEE Transactions on Visualization and Computer Graphics 13, 6 (2007), 1216-1223. Koren Y., Carmel L., Harel D.: Drawing Huge Graphs by Algebraic Multigrid Optimization. Multiscale Modeling and Simulation 1, 4 (2003), 645-673. Becker R. A., Eick S. G., Wilks A. R.: Visualizing Network Data. IEEE Transactions on Visualization and Computer Graphics 1, 1 (1995), 16-28. Harel D., Koren Y.: A Fast Multi-Scale Method for Drawing Large Graphs. Journal of Graph Algorithms and Applications 6, 3 (2002), 179-202. Kaufmann M., Wagner D.: Drawing Graphs: Methods and Models. Springer, 2001. Kamada T., Kawai S.: An Algorithm for Drawing General Undirected Graphs. Information Processing Letters 31, 1 (1989), 7-15. Barnes J., Hut P.: A Hierarchical O(N log N) Force-Calculation Algorithm. Nature 324, 4 (1986), 446-449. Frishman Y., Tal A.: Multi-Level Graph Layout on the GPU. IEEE Transactions on Visualization and Computer Graphics 13, 6 (2007), 1310-1319. Holten D.: Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data. IEEE Transactions on Visualization and Computer Graphics (Proc. of INFOVIS'06) 12, 5 (2006), 741-748. Herman I., Melançon G., Marshall M. S.: Graph Visualization and Navigation in Information Visualization: A Survey. IEEE Transactions on Visualization and Computer Graphics 6, 1 (2000), 24-43. 1989; 31 1986; 324 2000; 6 2006; 12 2001 1991; 21 2002; 6 2008; 14 1997 2008 2007 1996 2006 2005 2004 2003 2003; 1 1995; 1 2007; 13 1999 e_1_2_8_27_2 e_1_2_8_23_2 e_1_2_8_24_2 e_1_2_8_25_2 e_1_2_8_26_2 e_1_2_8_9_2 e_1_2_8_3_2 e_1_2_8_6_2 e_1_2_8_5_2 e_1_2_8_8_2 e_1_2_8_7_2 Barnes J. (e_1_2_8_4_2) 1986; 324 e_1_2_8_20_2 e_1_2_8_21_2 e_1_2_8_22_2 Battista G. D. (e_1_2_8_2_2) 1999 e_1_2_8_16_2 e_1_2_8_17_2 e_1_2_8_18_2 e_1_2_8_19_2 e_1_2_8_12_2 e_1_2_8_13_2 e_1_2_8_14_2 e_1_2_8_15_2 e_1_2_8_10_2 e_1_2_8_11_2 |
| References_xml | – reference: Harel D., Koren Y.: A Fast Multi-Scale Method for Drawing Large Graphs. Journal of Graph Algorithms and Applications 6, 3 (2002), 179-202. – reference: Ellis G., Dix A.: A Taxonomy of Clutter Reduction for Information Visualisation. IEEE Transactions on Visualization and Computer Graphics 13, 6 (2007), 1216-1223. – reference: Herman I., Melançon G., Marshall M. S.: Graph Visualization and Navigation in Information Visualization: A Survey. IEEE Transactions on Visualization and Computer Graphics 6, 1 (2000), 24-43. – reference: Kamada T., Kawai S.: An Algorithm for Drawing General Undirected Graphs. Information Processing Letters 31, 1 (1989), 7-15. – reference: Cui W., Zhou H., Qu H., Wong P. C., Li X.: Geometry-Based Edge Clustering for Graph Visualization. IEEE Transactions on Visualization and Computer Graphics (Proc. of INFOVIS'08) 14, 6 (2008), 1277-1284. – reference: Becker R. A., Eick S. G., Wilks A. R.: Visualizing Network Data. IEEE Transactions on Visualization and Computer Graphics 1, 1 (1995), 16-28. – reference: Frishman Y., Tal A.: Multi-Level Graph Layout on the GPU. IEEE Transactions on Visualization and Computer Graphics 13, 6 (2007), 1310-1319. – reference: Barnes J., Hut P.: A Hierarchical O(N log N) Force-Calculation Algorithm. Nature 324, 4 (1986), 446-449. – reference: Holten D.: Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data. IEEE Transactions on Visualization and Computer Graphics (Proc. of INFOVIS'06) 12, 5 (2006), 741-748. – reference: Kaufmann M., Wagner D.: Drawing Graphs: Methods and Models. Springer, 2001. – reference: Battista G. D., Eades P., Tamassia R., Tol-Lis I. G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1999. – reference: Fruchterman T. M. J., Reingold E. M.: Graph Drawing by Force-Directed Placement. Software - Practice and Experience 21, 11 (1991), 1129-1164. – reference: Koren Y., Carmel L., Harel D.: Drawing Huge Graphs by Algebraic Multigrid Optimization. Multiscale Modeling and Simulation 1, 4 (2003), 645-673. – volume: 6 start-page: 24 issue: 1 year: 2000 end-page: 43 article-title: Graph Visualization and Navigation in Information Visualization: A Survey publication-title: IEEE Transactions on Visualization and Computer Graphics – volume: 12 start-page: 741 issue: 5 year: 2006 end-page: 748 article-title: Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data publication-title: IEEE Transactions on Visualization and Computer Graphics (Proc. of INFOVIS'06) – volume: 13 start-page: 1310 issue: 6 year: 2007 end-page: 1319 article-title: Multi‐Level Graph Layout on the GPU publication-title: IEEE Transactions on Visualization and Computer Graphics – year: 2001 – start-page: 239 year: 2004 end-page: 250 – start-page: 51 year: 2005 end-page: 52 – start-page: 1 year: 2003 end-page: 12 – volume: 1 start-page: 16 issue: 1 year: 1995 end-page: 28 article-title: Visualizing Network Data publication-title: IEEE Transactions on Visualization and Computer Graphics – volume: 1 start-page: 645 issue: 4 year: 2003 end-page: 673 article-title: Drawing Huge Graphs by Algebraic Multigrid Optimization publication-title: Multiscale Modeling and Simulation – start-page: 17 year: 2004 end-page: 24 – volume: 31 start-page: 7 issue: 1 year: 1989 end-page: 15 article-title: An Algorithm for Drawing General Undirected Graphs publication-title: Information Processing Letters – volume: 14 start-page: 1277 issue: 6 year: 2008 end-page: 1284 article-title: Geometry‐Based Edge Clustering for Graph Visualization publication-title: IEEE Transactions on Visualization and Computer Graphics (Proc. of INFOVIS'08) – start-page: 55 year: 2008 end-page: 62 – volume: 13 start-page: 1216 issue: 6 year: 2007 end-page: 1223 article-title: A Taxonomy of Clutter Reduction for Information Visualisation publication-title: IEEE Transactions on Visualization and Computer Graphics – volume: 324 start-page: 446 issue: 4 year: 1986 end-page: 449 article-title: A Hierarchical O(N log N) Force‐Calculation Algorithm publication-title: Nature – volume: 21 start-page: 1129 issue: 11 year: 1991 end-page: 1164 article-title: Graph Drawing by Force‐Directed Placement publication-title: Software - Practice and Experience – volume: 6 start-page: 179 issue: 3 year: 2002 end-page: 202 article-title: A Fast Multi‐Scale Method for Drawing Large Graphs publication-title: Journal of Graph Algorithms and Applications – start-page: 113 year: 1996 end-page: 128 – start-page: 51 year: 2003 end-page: 58 – year: 1997 – start-page: 386 year: 2006 end-page: 398 – start-page: 399 year: 2006 end-page: 404 – start-page: 227 year: 2003 end-page: 232 – start-page: 219 year: 2005 end-page: 224 – year: 1999 – start-page: 8 year: 2007 end-page: 19 – ident: e_1_2_8_5_2 doi: 10.1109/TVCG.2008.135 – ident: e_1_2_8_9_2 doi: 10.1007/3-540-62495-3_42 – volume: 324 start-page: 446 issue: 4 year: 1986 ident: e_1_2_8_4_2 article-title: A Hierarchical O(N log N) Force‐Calculation Algorithm publication-title: Nature doi: 10.1038/324446a0 – ident: e_1_2_8_12_2 doi: 10.1109/TVCG.2007.70580 – ident: e_1_2_8_15_2 doi: 10.1007/978-3-540-31843-9_25 – ident: e_1_2_8_20_2 doi: 10.1016/0020-0190(89)90102-6 – ident: e_1_2_8_21_2 doi: 10.1007/3-540-44969-8 – ident: e_1_2_8_23_2 doi: 10.1007/978-3-540-70904-6_38 – ident: e_1_2_8_24_2 – ident: e_1_2_8_7_2 doi: 10.1007/978-3-540-70904-6_3 – ident: e_1_2_8_17_2 doi: 10.1109/2945.841119 – ident: e_1_2_8_11_2 doi: 10.1002/spe.4380211102 – ident: e_1_2_8_26_2 – ident: e_1_2_8_18_2 doi: 10.1109/TVCG.2006.147 – volume-title: Graph Drawing: Algorithms for the Visualization of Graphs year: 1999 ident: e_1_2_8_2_2 – ident: e_1_2_8_27_2 doi: 10.1109/PACIFICVIS.2008.4475459 – ident: e_1_2_8_25_2 – ident: e_1_2_8_3_2 doi: 10.1109/2945.468391 – ident: e_1_2_8_22_2 – ident: e_1_2_8_16_2 doi: 10.7155/jgaa.00051 – ident: e_1_2_8_14_2 doi: 10.1007/978-3-540-70904-6_37 – ident: e_1_2_8_19_2 doi: 10.1137/S154034590241370X – ident: e_1_2_8_13_2 – ident: e_1_2_8_8_2 doi: 10.1109/TVCG.2007.70535 – ident: e_1_2_8_10_2 – ident: e_1_2_8_6_2 doi: 10.1007/978-3-540-24595-7_1 |
| SSID | ssj0004765 |
| Score | 2.4535537 |
| Snippet | Graphs depicted as node‐link diagrams are widely used to show relationships between entities. However, node‐link diagrams comprised of a large number of nodes... Graphs depicted as node-link diagrams are widely used to show relationships between entities. However, node-link diagrams comprised of a large number of nodes... |
| SourceID | proquest crossref wiley istex |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 983 |
| SubjectTerms | Computer based modeling Geometry Graphs I.3.3 [Computer Graphics]: Picture/Image Generation-Line and Curve Generation I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling-Physically Based Modeling Studies Visualization |
| Title | Force-Directed Edge Bundling for Graph Visualization |
| URI | https://api.istex.fr/ark:/67375/WNG-C4R1WK7G-L/fulltext.pdf https://onlinelibrary.wiley.com/doi/abs/10.1111%2Fj.1467-8659.2009.01450.x https://www.proquest.com/docview/194656234 https://www.proquest.com/docview/34748323 |
| Volume | 28 |
| WOSCitedRecordID | wos000268217500036&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVWIB databaseName: Wiley Online Library - Journals customDbUrl: eissn: 1467-8659 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004765 issn: 0167-7055 databaseCode: DRFUL dateStart: 19970101 isFulltext: true titleUrlDefault: https://onlinelibrary.wiley.com providerName: Wiley-Blackwell |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lb9QwEB6hXQ700EKhaiiPHBC3oDh2_DjC0iwSqxWq-rpZiR9V1SpbbbqoR34Cv5FfUk-SXbqCQ1X1Fikay5mH_cWe-Qbgg6l4SVhlEm5LlTCeskQ56hPF8tRJYwVt-6ccT8R0Kk9P1Y8-_wlrYTp-iNWBG0ZGu15jgJdV82-QS56rnnaShPE_BTw5zIIb5wMYfj0ojiZ_qyQFz5dM38ghs57X89-x1jarIer9Zg2J3sWz7YZUbD3mpzyHzR6Wxp87P3oBT1y9DRt3yApfAi9mc-P-_PrdrZLOxvv2zMVfFrXFkvY4oN94jPTX8fF5g6WaXYHnKzgq9g9H35K-60JiWIAPieeI2mywIDWt0lTqmAzAkHuTWu6sTSuRVpXLSkp8HhAONzJ1pFS0otwzugODela7XYilI5WTzkvmDct8XgpqFWFOIgmc91kEYqlebXpKcuyMcanXfk2ERs1gw0ylW83omwjISvKqo-W4h8zH1oIrgXJ-gWltItcn07EesQNy8l2M9SSCvaWJdR_RjSYKmeUyyiJ4v3obQhHvV8razRaNDm7NwgJJI-Ctte89Mz0aF_j0-qGCe_Csu-XC06E3MLieL9xbeGp-Xp8383d9INwCb7sDdA |
| linkProvider | Wiley-Blackwell |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT9wwEB4hFqntgdIHakpbckC9pYrXjh9HuiULIl1ViNfNSvxAiCpb7bIVR34Cv7G_pJ4ku2VFD6jqLVI0TjIP-8vY8w3Ajql4SVhlEm5LlTCeskQ56hPFstRJYwVt-qecFmI0kufn6lvXDghrYVp-iEXCDSOjma8xwDEh_TDKJc9UxztJwgM-BUDZY8Grgrv3vhzlJ8WfMknBsznVN5LILB_s-etYS6tVDxV_swRF7wPaZkXKn__Xb9mA9Q6YxrutJ72AFVe_hGf36ApfAc_HE-N-3d6186Sz8Z69cPHnWW2xqD0O-DceIgF2fHo5xWLNtsTzNZzke8eD_aTru5AYFgBE4jniNhtsSE2jNZU6JgM05N6kljtr00qkVeX6JSU-CxiHG5k6UipaUe4Z3YTVely7NxBLRyonnZfMG9b3WSmoVYQ5iTRw3vcjEHP9atORkmNvjO966edEaNQMtsxUutGMvomALCR_tMQcj5D52JhwIVBOrvBgm8j02WioB-yInB2KoS4i2JrbWHcxPdVEIbdcn7IIthd3QzDiDktZu_FsqoNjszBF0gh4Y-5Hv5keDHO8evuvgtvwZP_4a6GLg9HhFjxt97wwV_QOVq8nM_ce1szP68vp5EMXFb8BEfsHZA |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lb9QwEB6hXYTooeUpQgvNAXELStaOH0fYNgvqalVV9HGzEntcVaBstduteuQn9DfyS_Ak2aUrOFSIW6RonGTGY3-xPd8H8M5Wosx4ZRPhSp1wkfJEI_OJ5nmKyjrJGv2Uk7GcTNTZmT7s5ICoFqblh1gtuFFmNOM1JTheOv9nliuR6453MgsP-BAAZZ-TpkwP-ntHxfH4d5mkFPmS6ptIZNYP9vy1rbXZqk-Ov1mDoncBbTMjFVv_9VuewGYHTOOPbU96Cg-wfgYbd-gKn4MopjOLP3_ctuMkunjfnWP8aVE7KmqPA_6NR0SAHZ9czKlYsy3xfAHHxf7X4eek011ILA8AIvGCcJsLMWS28ZpOkasADYW3qRPoXFrJtKpwULLM5wHjCKtSzErNKiY8Zy-hV09rfAWxwqxChV5xb_nA56VkTmccFdHAeT-IQC79a2xHSk7aGN_N2s-JNOQZkszUpvGMuYkgW1letsQc97B534RwZVDOvtHBNpmb08nIDPlRdnogR2YcwfYyxqbL6bnJNHHLDRiPYHd1NyQj7bCUNU4XcxM6Ng9DJItANOG-95uZ4aigq9f_argLjw73CjP-MjnYhsftlhctFe1A72q2wDfw0F5fXcxnb7uk-AWOgAbf |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Force-Directed+Edge+Bundling+for+Graph+Visualization&rft.jtitle=Computer+graphics+forum&rft.au=Holten%2C+Danny&rft.au=van+Wijk%2C+Jarke+J&rft.date=2009-06-01&rft.issn=0167-7055&rft.volume=28&rft.issue=3&rft.spage=983&rft.epage=990&rft_id=info:doi/10.1111%2Fj.1467-8659.2009.01450.x&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-7055&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-7055&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-7055&client=summon |