ImPrEd: An Improved Force-Directed Algorithm that Prevents Nodes from Crossing Edges
PrEd [Ber00] is a force‐directed algorithm that improves the existing layout of a graph while preserving its edge crossing properties. The algorithm has a number of applications including: improving the layouts of planar graph drawing algorithms, interacting with a graph layout, and drawing Euler‐li...
Saved in:
| Published in: | Computer graphics forum Vol. 30; no. 3; pp. 1071 - 1080 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Oxford, UK
Blackwell Publishing Ltd
01.06.2011
Wiley |
| Series: | IEEE Symposium on visualization 2011 (EuroVis 2011) |
| Subjects: | |
| ISSN: | 0167-7055, 1467-8659 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | PrEd [Ber00] is a force‐directed algorithm that improves the existing layout of a graph while preserving its edge crossing properties. The algorithm has a number of applications including: improving the layouts of planar graph drawing algorithms, interacting with a graph layout, and drawing Euler‐like diagrams. The algorithm ensures that nodes do not cross edges during its execution. However, PrEd can be computationally expensive and overly‐restrictive in terms of node movement.
In this paper, we introduce ImPrEd: an improved version of PrEd that overcomes some of its limitations and widens its range of applicability. ImPrEd also adds features such as flexible or crossable edges, allowing for greater control over the output. Flexible edges, in particular, can improve the distribution of graph elements and the angular resolution of the input graph. They can also be used to generate Euler diagrams with smooth boundaries. As flexible edges increase data set size, we experience an execution/drawing quality trade off. However, when flexible edges are not used, ImPrEdproves to be consistently faster than PrEd. |
|---|---|
| AbstractList | PrEd is a force-directed algorithm that improves the existing layout of a graph while preserving its edge crossing properties. The algorithm has a number of applications including: improving the layouts of planar graph drawing algorithms, interacting with a graph layout, and drawing Euler-like diagrams. The algorithm ensures that nodes do not cross edges during its execution. However, PrEd can be computationally expensive and overly-restrictive in terms of node movement. In this paper, we introduce ImPrEd: an improved version of PrEd that overcomes some of its limitations and widens its range of applicability. ImPrEd also adds features such as flexible or crossable edges, allowing for greater control over the output. Flexible edges, in particular, can improve the distribution of graph elements and the angular resolution of the input graph. They can also be used to generate Euler diagrams with smooth boundaries. As flexible edges increase data set size, we experience an execution/drawing quality trade off. However, when flexible edges are not used, ImPrEd proves to be consistently faster than PrEd. PrEd [ Ber00 ] is a force‐directed algorithm that improves the existing layout of a graph while preserving its edge crossing properties. The algorithm has a number of applications including: improving the layouts of planar graph drawing algorithms, interacting with a graph layout, and drawing Euler‐like diagrams. The algorithm ensures that nodes do not cross edges during its execution. However, PrEd can be computationally expensive and overly‐restrictive in terms of node movement. In this paper, we introduce ImPrEd: an improved version of PrEd that overcomes some of its limitations and widens its range of applicability. ImPrEd also adds features such as flexible or crossable edges, allowing for greater control over the output. Flexible edges, in particular, can improve the distribution of graph elements and the angular resolution of the input graph. They can also be used to generate Euler diagrams with smooth boundaries. As flexible edges increase data set size, we experience an execution/drawing quality trade off. However, when flexible edges are not used, ImPrEdproves to be consistently faster than PrEd. Abstract PrEd [Ber00] is a force-directed algorithm that improves the existing layout of a graph while preserving its edge crossing properties. The algorithm has a number of applications including: improving the layouts of planar graph drawing algorithms, interacting with a graph layout, and drawing Euler-like diagrams. The algorithm ensures that nodes do not cross edges during its execution. However, PrEd can be computationally expensive and overly-restrictive in terms of node movement. In this paper, we introduce ImPrEd: an improved version of PrEd that overcomes some of its limitations and widens its range of applicability. ImPrEd also adds features such as flexible or crossable edges, allowing for greater control over the output. Flexible edges, in particular, can improve the distribution of graph elements and the angular resolution of the input graph. They can also be used to generate Euler diagrams with smooth boundaries. As flexible edges increase data set size, we experience an execution/drawing quality trade off. However, when flexible edges are not used, ImPrEdproves to be consistently faster than PrEd. [PUBLICATION ABSTRACT] PrEd [Ber00] is a force‐directed algorithm that improves the existing layout of a graph while preserving its edge crossing properties. The algorithm has a number of applications including: improving the layouts of planar graph drawing algorithms, interacting with a graph layout, and drawing Euler‐like diagrams. The algorithm ensures that nodes do not cross edges during its execution. However, PrEd can be computationally expensive and overly‐restrictive in terms of node movement. In this paper, we introduce ImPrEd: an improved version of PrEd that overcomes some of its limitations and widens its range of applicability. ImPrEd also adds features such as flexible or crossable edges, allowing for greater control over the output. Flexible edges, in particular, can improve the distribution of graph elements and the angular resolution of the input graph. They can also be used to generate Euler diagrams with smooth boundaries. As flexible edges increase data set size, we experience an execution/drawing quality trade off. However, when flexible edges are not used, ImPrEdproves to be consistently faster than PrEd. PrEd [Ber00] is a force-directed algorithm that improves the existing layout of a graph while preserving its edge crossing properties. The algorithm has a number of applications including: improving the layouts of planar graph drawing algorithms, interacting with a graph layout, and drawing Euler-like diagrams. The algorithm ensures that nodes do not cross edges during its execution. However, PrEd can be computationally expensive and overly-restrictive in terms of node movement. In this paper, we introduce ImPrEd: an improved version of PrEd that overcomes some of its limitations and widens its range of applicability. ImPrEd also adds features such as flexible or crossable edges, allowing for greater control over the output. Flexible edges, in particular, can improve the distribution of graph elements and the angular resolution of the input graph. They can also be used to generate Euler diagrams with smooth boundaries. As flexible edges increase data set size, we experience an execution/drawing quality trade off. However, when flexible edges are not used, ImPrEdproves to be consistently faster than PrEd. |
| Author | Auber, David Bourqui, Romain Simonetto, Paolo Archambault, Daniel |
| Author_xml | – sequence: 1 givenname: Paolo surname: Simonetto fullname: Simonetto, Paolo organization: LaBRI, Université Bordeaux 1 - INRIA, Bordeaux Sud-Ouest – sequence: 2 givenname: Daniel surname: Archambault fullname: Archambault, Daniel organization: University College Dublin – sequence: 3 givenname: David surname: Auber fullname: Auber, David organization: LaBRI, Université Bordeaux 1 - INRIA, Bordeaux Sud-Ouest – sequence: 4 givenname: Romain surname: Bourqui fullname: Bourqui, Romain organization: LaBRI, Université Bordeaux 1 - INRIA, Bordeaux Sud-Ouest |
| BackLink | https://inria.hal.science/inria-00605921$$DView record in HAL |
| BookMark | eNqNkV9r2zAUxc3oYGm372D2sodh78q2JHuwQUjzr4SuD4HBXi6KfZ0os61WcrL0209e1j70qXrRFTq_czmcy-CiMx0FQcggZv582ccsEzLKBS_iBBiLgRVcxKc3wej54yIYAfOzBM7fBZfO7QEgk4KPgvWyvbPT6ms47sJle2_NkapwZmxJ0bW2VPb-OW62xup-14b9TvXhnaUjdb0Lb01FLqytacOJNc7pbhtOqy2598HbWjWOPvy_r4L1bLqeLKLVj_lyMl5FZZYJEVWy2lAtSRCnIkmYlKyQeZXmRJXixGsOBQFs6kpmlJSbFDYZpFCSHyVs0qvg89l2pxq8t7pV9hGN0rgYr1B3VisEEMCLhB2ZV386q33IhwO5HlvtSmoa1ZE5OMwLkbDUr_TKjy-Ue3OwnU-CucxApILlXvT9LCqH6JZqLHWvem263irdIAMc-sE9DjXgUAMO_eC_fvDkDfIXBk8RXoF-O6N_dEOPr-ZwMp8Nk-ejM69dT6dnXtnfKGQqOf68neMCrn_l8iZHlv4FuTi3ZA |
| CitedBy_id | crossref_primary_10_1109_TVCG_2015_2467992 crossref_primary_10_1016_j_jvlc_2017_09_008 crossref_primary_10_1147_JRD_2015_2411412 crossref_primary_10_1080_13658816_2014_887718 crossref_primary_10_1109_TVCG_2012_208 crossref_primary_10_1111_cgf_15089 crossref_primary_10_1109_TVCG_2015_2467413 crossref_primary_10_1016_j_protcy_2012_09_073 crossref_primary_10_1080_10556788_2023_2205646 crossref_primary_10_1109_TVCG_2017_2745919 crossref_primary_10_4018_irmj_2014010105 crossref_primary_10_1109_TVCG_2018_2886901 |
| Cites_doi | 10.1007/BF02122694 10.1002/spe.4380211102 10.1007/978-3-540-77537-9_36 10.1109/PACIFICVIS.2009.4906846 10.1109/PACIFICVIS.2010.5429590 10.1111/j.1467-8659.2009.01449.x 10.1007/3-540-58950-3_393 10.1111/j.1467-8659.2009.01452.x 10.1109/INFVIS.2004.43 10.1007/3-540-63938-1_67 10.1109/INFVIS.2004.18 10.1109/INFVIS.2005.1532130 10.1016/S0020-0190(00)00042-9 10.1007/978-3-642-18469-7_15 10.1007/978-3-642-00219-9_22 10.1007/978-3-540-24595-7_9 10.1109/2945.841119 10.1109/TVCG.2006.156 10.1007/3-540-37623-2_13 10.1007/978-3-662-04245-8 10.1007/3-540-44541-2_19 10.1109/TVCG.2008.11 |
| ContentType | Journal Article |
| Copyright | 2011 The Author(s) Journal compilation © 2011 The Eurographics Association and Blackwell Publishing Ltd. Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: 2011 The Author(s) Journal compilation © 2011 The Eurographics Association and Blackwell Publishing Ltd. – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | BSCLL AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D F28 FR3 1XC VOOES |
| DOI | 10.1111/j.1467-8659.2011.01956.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 Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access) |
| 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 | CrossRef Computer and Information Systems Abstracts Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1467-8659 |
| EndPage | 1080 |
| ExternalDocumentID | oai:HAL:inria-00605921v1 2387062331 10_1111_j_1467_8659_2011_01956_x CGF1956 ark_67375_WNG_H0DZ87J8_1 |
| 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 1XC VOOES |
| ID | FETCH-LOGICAL-c4466-d7dbef7e6e5e9221771978d38eeda5e5f509e00bfd74e2cb30b4030cecb370b3 |
| IEDL.DBID | DRFUL |
| ISICitedReferencesCount | 18 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000292164300045&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 | Tue Oct 14 20:18:11 EDT 2025 Thu Sep 04 17:37:04 EDT 2025 Sun Nov 09 08:30:19 EST 2025 Sat Nov 29 03:41:07 EST 2025 Tue Nov 18 22:02:27 EST 2025 Sun Sep 21 06:21:12 EDT 2025 Tue Nov 11 03:30:59 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Language | English |
| License | Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c4466-d7dbef7e6e5e9221771978d38eeda5e5f509e00bfd74e2cb30b4030cecb370b3 |
| Notes | istex:A278695655999835F5065ACD8ECAB21A00CBEC86 ArticleID:CGF1956 ark:/67375/WNG-H0DZ87J8-1 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| ORCID | 0000-0002-1114-8612 0000-0002-1847-2589 |
| OpenAccessLink | https://inria.hal.science/inria-00605921 |
| PQID | 874063618 |
| PQPubID | 30877 |
| PageCount | 10 |
| ParticipantIDs | hal_primary_oai_HAL_inria_00605921v1 proquest_miscellaneous_896213509 proquest_journals_874063618 crossref_citationtrail_10_1111_j_1467_8659_2011_01956_x crossref_primary_10_1111_j_1467_8659_2011_01956_x wiley_primary_10_1111_j_1467_8659_2011_01956_x_CGF1956 istex_primary_ark_67375_WNG_H0DZ87J8_1 |
| PublicationCentury | 2000 |
| PublicationDate | June 2011 |
| PublicationDateYYYYMMDD | 2011-06-01 |
| PublicationDate_xml | – month: 06 year: 2011 text: June 2011 |
| PublicationDecade | 2010 |
| PublicationPlace | Oxford, UK |
| PublicationPlace_xml | – name: Oxford, UK – name: Oxford |
| PublicationSeriesTitle | IEEE Symposium on visualization 2011 (EuroVis 2011) |
| PublicationTitle | Computer graphics forum |
| PublicationYear | 2011 |
| Publisher | Blackwell Publishing Ltd Wiley |
| Publisher_xml | – name: Blackwell Publishing Ltd – name: Wiley |
| References | Di Battista G., Eades P., Tamassia R., Tollis I. G.: Graph Drawing; Algorithms for the Visualization of Graphs. Prentice Hall, July 1998. Dwyer T., Koren Y., Marriott K.: IPSep-CoLa: An incremental procedure for separation constraint layout of graphs. IEEE Transactions on Visualization and Computer Graphics (InfoVis06) 12, 5 (Sept. 2006), 821-828. Bertault F.: A force-directed algorithm that preserves edge crossing properties. Information Processing Letters 74, 1-2 (Apr. 2000), 7-13. Dwyer T.: Scalable, versatile and simple constrained graph layout. Computer Graphics Forum (EuroVis09) 28, 3 (June 2009), 991-998. De Fraysseix H., Pach J., Pollack R.: How to draw a planar graph on a grid. Combinatorica 10, 1 (1990), 41-51. Frishman Y., Tal A.: Online dynamic graph drawing. IEEE Transactions on Visualization and Computer Graphics 14, 4 (2008), 727-740. Simonetto P., Auber D., Archambault D.: Fully automatic visualisation of overlapping sets. Computer Graphics Forum (EuroVis09) 28, 3 (June 2009), 967-974. Fruchterman T. M., Reingold E. M.: Graph drawing by force-directed placement. Software: Practice and Experience 21, 11 (Nov. 1991), 1129-1164. Nishizeki T., Rahman M. S.: Planar Graph Drawing, vol. 12 of Lecture Notes Series on Computing. World Scientific, Sept. 2004. 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. Eades P.: A heuristic for graph drawing. Congressus numerantium 42 (1984), 149-160. De Berg M., Cheong O., Van Kreveld M., Overmars M.: Computational Geometry: Algorithms and Applications. Springer-Verlag, 2000. 1990; 10 1984; 42 Sept. 2006; 12 2011; 6502 July 1998 2000; 6 2010 2008; 14 2009 2005 1995; 894 2004 Sept. 2004 2001; 1984 2002 2004; 2912 1998; 1547 Jan. 2008; 76 2009; 5417 2008; 4875 Nov. 1991; 21 1997; 1353 2000 Apr. 2000; 74 June 2009; 28 e_1_2_9_10_2 Nishizeki T. (e_1_2_9_23_2) 2004 e_1_2_9_12_2 e_1_2_9_11_2 Saffrey P. (e_1_2_9_27_2) 2008 e_1_2_9_14_2 e_1_2_9_16_2 e_1_2_9_15_2 Eades P. (e_1_2_9_13_2) 1984; 42 e_1_2_9_18_2 e_1_2_9_19_2 e_1_2_9_21_2 e_1_2_9_20_2 e_1_2_9_22_2 e_1_2_9_7_2 e_1_2_9_6_2 e_1_2_9_4_2 e_1_2_9_3_2 e_1_2_9_2_2 Di Battista G. (e_1_2_9_5_2) 1998 e_1_2_9_9_2 Frishman Y. (e_1_2_9_17_2) 2004 e_1_2_9_8_2 e_1_2_9_25_2 e_1_2_9_24_2 e_1_2_9_26_2 e_1_2_9_28_2 |
| References_xml | – reference: Di Battista G., Eades P., Tamassia R., Tollis I. G.: Graph Drawing; Algorithms for the Visualization of Graphs. Prentice Hall, July 1998. – reference: Fruchterman T. M., Reingold E. M.: Graph drawing by force-directed placement. Software: Practice and Experience 21, 11 (Nov. 1991), 1129-1164. – reference: Frishman Y., Tal A.: Online dynamic graph drawing. IEEE Transactions on Visualization and Computer Graphics 14, 4 (2008), 727-740. – reference: De Fraysseix H., Pach J., Pollack R.: How to draw a planar graph on a grid. Combinatorica 10, 1 (1990), 41-51. – reference: Dwyer T., Koren Y., Marriott K.: IPSep-CoLa: An incremental procedure for separation constraint layout of graphs. IEEE Transactions on Visualization and Computer Graphics (InfoVis06) 12, 5 (Sept. 2006), 821-828. – reference: Bertault F.: A force-directed algorithm that preserves edge crossing properties. Information Processing Letters 74, 1-2 (Apr. 2000), 7-13. – reference: Nishizeki T., Rahman M. S.: Planar Graph Drawing, vol. 12 of Lecture Notes Series on Computing. World Scientific, Sept. 2004. – reference: Simonetto P., Auber D., Archambault D.: Fully automatic visualisation of overlapping sets. Computer Graphics Forum (EuroVis09) 28, 3 (June 2009), 967-974. – reference: Eades P.: A heuristic for graph drawing. Congressus numerantium 42 (1984), 149-160. – reference: De Berg M., Cheong O., Van Kreveld M., Overmars M.: Computational Geometry: Algorithms and Applications. Springer-Verlag, 2000. – reference: Dwyer T.: Scalable, versatile and simple constrained graph layout. Computer Graphics Forum (EuroVis09) 28, 3 (June 2009), 991-998. – 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. – volume: 21 start-page: 1129 issue: 11 year: Nov. 1991 end-page: 1164 article-title: Graph drawing by force‐directed placement publication-title: Software: Practice and Experience – volume: 28 start-page: 991 issue: 3 year: June 2009 end-page: 998 article-title: Scalable, versatile and simple constrained graph layout publication-title: Computer Graphics Forum (EuroVis09) – volume: 12 start-page: 821 issue: 5 year: Sept. 2006 end-page: 828 article-title: IPSep‐CoLa: An incremental procedure for separation constraint layout of graphs publication-title: IEEE Transactions on Visualization and Computer Graphics (InfoVis06) – volume: 6502 start-page: 165 year: 2011 end-page: 176 – volume: 1547 start-page: 167 year: 1998 end-page: 182 – start-page: 121 year: 2009 end-page: 128 – volume: 74 start-page: 7 issue: 1–2 year: Apr. 2000 end-page: 13 article-title: A force‐directed algorithm that preserves edge crossing properties publication-title: Information Processing Letters – year: 2000 – start-page: 201 year: 2010 end-page: 208 – start-page: 199 year: 2004 end-page: 206 – volume: 894 start-page: 388 year: 1995 end-page: 403 – volume: 1984 start-page: 197 year: 2001 end-page: 210 – volume: 5417 start-page: 230 year: 2009 end-page: 241 – volume: 42 start-page: 149 year: 1984 end-page: 160 article-title: A heuristic for graph drawing publication-title: Congressus numerantium – volume: 1353 start-page: 248 year: 1997 end-page: 261 – start-page: 65 year: 2005 end-page: 72 – year: July 1998 – volume: 14 start-page: 727 issue: 4 year: 2008 end-page: 740 article-title: Online dynamic graph drawing publication-title: IEEE Transactions on Visualization and Computer Graphics – volume: 10 start-page: 41 issue: 1 year: 1990 end-page: 51 article-title: How to draw a planar graph on a grid publication-title: Combinatorica – volume: 28 start-page: 967 issue: 3 year: June 2009 end-page: 974 article-title: Fully automatic visualisation of overlapping sets publication-title: Computer Graphics Forum (EuroVis09) – volume: 4875 start-page: 365 year: 2008 end-page: 376 – year: 2002 – year: Sept. 2004 – volume: 76 start-page: 85 year: Jan. 2008 end-page: 93 – start-page: 191 year: 2004 end-page: 198 – volume: 2912 start-page: 98 year: 2004 end-page: 110 – 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 – ident: e_1_2_9_7_2 doi: 10.1007/BF02122694 – ident: e_1_2_9_16_2 doi: 10.1002/spe.4380211102 – ident: e_1_2_9_2_2 doi: 10.1007/978-3-540-77537-9_36 – ident: e_1_2_9_22_2 doi: 10.1109/PACIFICVIS.2009.4906846 – ident: e_1_2_9_19_2 doi: 10.1109/PACIFICVIS.2010.5429590 – volume: 42 start-page: 149 year: 1984 ident: e_1_2_9_13_2 article-title: A heuristic for graph drawing publication-title: Congressus numerantium – ident: e_1_2_9_12_2 doi: 10.1111/j.1467-8659.2009.01449.x – start-page: 85 volume-title: Australasian User Interface Conference (AUIC08) year: 2008 ident: e_1_2_9_27_2 – ident: e_1_2_9_15_2 doi: 10.1007/3-540-58950-3_393 – ident: e_1_2_9_26_2 doi: 10.1111/j.1467-8659.2009.01452.x – volume-title: Planar Graph Drawing, vol. 12 of Lecture Notes Series on Computing year: 2004 ident: e_1_2_9_23_2 – volume-title: Graph Drawing; Algorithms for the Visualization of Graphs year: 1998 ident: e_1_2_9_5_2 – ident: e_1_2_9_28_2 doi: 10.1109/INFVIS.2004.43 – ident: e_1_2_9_24_2 doi: 10.1007/3-540-63938-1_67 – ident: e_1_2_9_6_2 – start-page: 191 volume-title: IEEE Symposium on Information Visualization (InfoVis04) year: 2004 ident: e_1_2_9_17_2 doi: 10.1109/INFVIS.2004.18 – ident: e_1_2_9_8_2 doi: 10.1109/INFVIS.2005.1532130 – ident: e_1_2_9_3_2 doi: 10.1016/S0020-0190(00)00042-9 – ident: e_1_2_9_10_2 doi: 10.1007/978-3-642-18469-7_15 – ident: e_1_2_9_11_2 doi: 10.1007/978-3-642-00219-9_22 – ident: e_1_2_9_14_2 doi: 10.1007/978-3-540-24595-7_9 – ident: e_1_2_9_21_2 doi: 10.1109/2945.841119 – ident: e_1_2_9_9_2 doi: 10.1109/TVCG.2006.156 – ident: e_1_2_9_20_2 doi: 10.1007/3-540-37623-2_13 – ident: e_1_2_9_4_2 doi: 10.1007/978-3-662-04245-8 – ident: e_1_2_9_25_2 doi: 10.1007/3-540-44541-2_19 – ident: e_1_2_9_18_2 doi: 10.1109/TVCG.2008.11 |
| SSID | ssj0004765 |
| Score | 2.111833 |
| Snippet | PrEd [Ber00] is a force‐directed algorithm that improves the existing layout of a graph while preserving its edge crossing properties. The algorithm has a... PrEd [ Ber00 ] is a force‐directed algorithm that improves the existing layout of a graph while preserving its edge crossing properties. The algorithm has a... Abstract PrEd [Ber00] is a force-directed algorithm that improves the existing layout of a graph while preserving its edge crossing properties. The algorithm... PrEd [Ber00] is a force-directed algorithm that improves the existing layout of a graph while preserving its edge crossing properties. The algorithm has a... PrEd is a force-directed algorithm that improves the existing layout of a graph while preserving its edge crossing properties. The algorithm has a number of... |
| SourceID | hal proquest crossref wiley istex |
| SourceType | Open Access Repository Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 1071 |
| SubjectTerms | Algorithms Angular resolution Computation Computer graphics Computer programming Computer Science G.2.2 [Discrete Mathematics]: Graph Theory Graph Algorithms Graphs Image processing systems Links Other Preserving Smooth boundaries Studies |
| Title | ImPrEd: An Improved Force-Directed Algorithm that Prevents Nodes from Crossing Edges |
| URI | https://api.istex.fr/ark:/67375/WNG-H0DZ87J8-1/fulltext.pdf https://onlinelibrary.wiley.com/doi/abs/10.1111%2Fj.1467-8659.2011.01956.x https://www.proquest.com/docview/874063618 https://www.proquest.com/docview/896213509 https://inria.hal.science/inria-00605921 |
| Volume | 30 |
| WOSCitedRecordID | wos000292164300045&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 Full Collection 2020 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/eLvHCXMwrV3NbtQwELZglwMcKH8VoQX5UHELSuJ1HPe22m66oNWqQqVUXKzEdrqrtkmVpFWPPALPyJMwk2RDV3CoEDcrGVvyeGY8Y4-_IWQvCwINbn3kmhBLmIUpdyPuWVemmmeJzZjXJMiezMViEZ2eyqMu_wnfwrT4EP2BG2pGY69RwZO0-lPJo5DLDokTn759AH9yGIAYjwZkePA5_jL__UpShHyN9I0YMpt5PX8da2OzerjEVMkhcv92wx-969U221K89T8n9Iw87ZxTOm6l6Tl5YPMX5MkdyMKX5OTj5VE5Nft0nNP2QMIaGheltj-__2jtJ3wYX5wV5apeXtJ6mdS0w4mq6KIwtqL4pIVOcMYwJJ0izMQrchxPjyczt6vN4Gq8AXaNMKnNhA0ttzKAuEb4EI8aFsGem3DLM3BErOelmREjG-iUeekI7Im20BReyrbJIC9y-5pQCxQMQmUpM3DNGEs0EHKTGc0CIXXqELFeA6U73HIsn3GhNuIXoZBxChmnGsapW4f4fc-rFrvjHn32YJl7cgTfno3napWDOVAIXsNl4N_4DnnfyEFPmJTnmCInuPq6OFQz7-BbJD5FCgh31oKiOutQKSyDGLLQjxxC-7-g1nhXk-S2uAYSGQY-AyY6JGyE5t4zUJPDGFtv_rXjDnncHpzjUdMuGdTltX1LHumbelWV7zqt-gUhrB1T |
| linkProvider | Wiley-Blackwell |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3NbtQwELZgF4ly4L8itIAPFbegJF7HCbfVdtMthKhCS6m4WIntsCvaBGXTqkcegWfkSTqTZENXcKgQNysZW_J4Zjwej78hZC_3PAVufWBrH0uY-Rm3A-4YO8wUz1OTM6dJkD2ORZIEJyfhUVcOCN_CtPgQfcANNaOx16jgGJD-U8sDn4cdFCe-fXsDDuVwBFLFB2S4_zH6FP9-Jil8vob6RhCZzcSev461sVvdXmCu5BDZf7nhkF53a5t9KXrwX2f0kNzv3FM6buXpEbllisfk3jXQwifk-PDsqJrqt3Rc0DYkYTSNykqZXz9-thYUPoxPv5bVsl6c0XqR1rRDilrRpNRmRfFRC53glGFIOkWgiadkHk3nk5ndVWewFd4B21rozOTC-Iab0IOTjXDhRKpZALtuyg3PwRUxjpPlWoyMpzLmZCOwKMpAUzgZ2yaDoizMM0INUDA4LIdhDs4ZY6kCQq5zrZgnQpVZRKwXQaoOuRwLaJzKjROMkMg4iYyTDePkpUXcvuf3Fr3jBn32YJ17coTfno1juSzAIEiEr-Gh5164FnndCEJPmFbfMElOcPk5OZAzZ_9LIN4FEgh31pIiO_uwklgI0We-G1iE9n9BsfG2Ji1MeQ4koe-5DJhoEb-RmhvPQE4OImw9_9eOr8jd2fxDLOPD5P0O2WrD6Bh42iWDujo3L8gddVEvV9XLTsWuAEeZIUM |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3NbtQwELagixAc-EeE8uNDxS0oidd2wm21u-kWVtEKlVJxsRLbYVe0SZVNqx55BJ6RJ2EmyYau4FAhblYytuTxzHhmbH9DyF4eBBrc-tA1AkuYiYy7IfesG2Wa56nNmddckD2ayyQJj4-jRVcOCN_CtPgQfcINNaOx16jg9szkf2p5KHjUQXHi27e34FAOhjwSoKWDycf40_z3M0kp-AbqG0Fkti_2_HWsrd3q5hLvSg6Q_ZdbDulVt7bZl-L7_3VGD8i9zj2lo1aeHpIbtnhE7l4BLXxMjg5OF9XUvKOjgrYpCWtoXFba_vz-o7Wg8GF08rWsVvXylNbLtKYdUtSaJqWxa4qPWugYpwxD0ikCTTwhh_H0cDxzu-oMrsYzYNdIk9lcWmG5jQKIbKQPEalhIey6Kbc8B1fEel6WGzm0gc6Ylw3BomgLTell7CnZKcrCPiPUAgWDYDmKcnDOGEs1EHKTG80CGenMIXKzCEp3yOVYQONEbUUwUiHjFDJONYxTlw7x-55nLXrHNfrswTr35Ai_PRvN1aoAg6AQvoZHgX_hO-RNIwg9YVp9w0tykqvPyb6aeZMvoXwfKiDc3UiK6uzDWmEhRMGEHzqE9n9BsfG0Ji1seQ4kkQh8Bkx0iGik5tozUOP9GFvP_7Xja3J7MYnV_CD5sEvutFl0zDu9IDt1dW5fklv6ol6tq1edhv0Cnlsgvg |
| 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=ImPrEd%3A+An+Improved+Force-Directed+Algorithm+that+Prevents+Nodes+from+Crossing+Edges&rft.jtitle=Computer+graphics+forum&rft.au=Simonetto%2C+Paolo&rft.au=Archambault%2C+Daniel&rft.au=Auber%2C+David&rft.au=Bourqui%2C+Romain&rft.date=2011-06-01&rft.pub=Blackwell+Publishing+Ltd&rft.issn=0167-7055&rft.eissn=1467-8659&rft.volume=30&rft.issue=3&rft.spage=1071&rft_id=info:doi/10.1111%2Fj.1467-8659.2011.01956.x&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=2387062331 |
| 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 |