Fully Automatic Visualisation of Overlapping Sets
Visualisation of taxonomies and sets has recently become an active area of research. Many application fields now require more than a strict classification of elements into a hierarchy tree. Euler diagrams, one of the most natural ways of depicting intersecting sets, may provide a solution to these p...
Uložené v:
| Vydané v: | Computer graphics forum Ročník 28; číslo 3; s. 967 - 974 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Oxford, UK
Blackwell Publishing Ltd
01.06.2009
Wiley |
| Predmet: | |
| ISSN: | 0167-7055, 1467-8659 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Visualisation of taxonomies and sets has recently become an active area of research. Many application fields now require more than a strict classification of elements into a hierarchy tree. Euler diagrams, one of the most natural ways of depicting intersecting sets, may provide a solution to these problems.
In this paper, we present an approach for the automatic generation of Euler‐like diagrams. This algorithm differs from previous approaches in that it has no undrawable instances of input, allowing it to be used in systems where the output is always required. We also improve the readability of Euler diagrams through the use of Bézier curves and transparent coloured textures. Our approach has been implemented using the Tulip platform. Both the source and executable program used to generate the results are freely available. |
|---|---|
| AbstractList | Visualisation of taxonomies and sets has recently become an active area of research. Many application fields now require more than a strict classification of elements into a hierarchy tree. Euler diagrams, one of the most natural ways of depicting intersecting sets, may provide a solution to these problems. In this paper, we present an approach for the automatic generation of Euler-like diagrams. This algorithm differs from previous approaches in that it has no undrawable instances of input, allowing it to be used in systems where the output is always required. We also improve the readability of Euler diagrams through the use of Bezier curves and transparent coloured textures. Our approach has been implemented using the Tulip platform. Both the source and executable program used to generate the results are freely available. Visualisation of taxonomies and sets has recently become an active area of research. Many application fields now require more than a strict classification of elements into a hierarchy tree. Euler diagrams, one of the most natural ways of depicting intersecting sets, may provide a solution to these problems. In this paper, we present an approach for the automatic generation of Euler-like diagrams. This algorithm differs from previous approaches in that it has no undrawable instances of input, allowing it to be used in systems where the output is always required. We also improve the readability of Euler diagrams through the use of Bézier curves and transparent coloured textures. Our approach has been implemented using the Tulip platform. Both the source and executable program used to generate the results are freely available. [PUBLICATION ABSTRACT] Visualisation of taxonomies and sets has recently become an active area of research. Many application fields now require more than a strict classification of elements into a hierarchy tree. Euler diagrams, one of the most natural ways of depicting intersecting sets, may provide a solution to these problems. In this paper, we present an approach for the automatic generation of Euler‐like diagrams. This algorithm differs from previous approaches in that it has no undrawable instances of input, allowing it to be used in systems where the output is always required. We also improve the readability of Euler diagrams through the use of Bézier curves and transparent coloured textures. Our approach has been implemented using the Tulip platform. Both the source and executable program used to generate the results are freely available. |
| Author | Auber, David Archambault, Daniel Simonetto, Paolo |
| Author_xml | – sequence: 1 givenname: Paolo surname: Simonetto fullname: Simonetto, Paolo organization: LaBRI, Université Bordeaux 1 & Gravité, INRIA Sud-Ouest, France – sequence: 2 givenname: David surname: Auber fullname: Auber, David organization: LaBRI, Université Bordeaux 1 & Gravité, INRIA Sud-Ouest, France – sequence: 3 givenname: Daniel surname: Archambault fullname: Archambault, Daniel organization: LaBRI, Université Bordeaux 1 & Gravité, INRIA Sud-Ouest, France |
| BackLink | https://hal.science/hal-00407269$$DView record in HAL |
| BookMark | eNqNkE9v0zAYxi00JLrBd4g4IHFI5r-xcwCpqmiLVLEDG9vtlZM64OLGxU5G--3nLLDDTvPF72v_nsd-n3N01vnOIJQRXJC0LncF4aXMVSmqgmJcFZhwQYvjKzR7ujhDM0xSLbEQb9B5jDuMMZelmCGyHJw7ZfOh93vd2yb7YeOgnY2p8V3m2-zq3gSnDwfb_cy-mz6-Ra9b7aJ592-_QDfLL9eLdb65Wn1dzDd5wzmjOU0PtlgSaZiiFa9bXhtWKWZ404qKqi1rjcGtrEvGRJNYybf1dktrVWuKFWYX6OPk-0s7OAS71-EEXltYzzcwnqURsKRldU8S-2FiD8H_GUzsYW9jY5zTnfFDBMaloFyN4Ptn4M4PoUtzAKl4qYggI_R5gprgYwymhcb2j3n0QVsHBMMYPexgTBjGhGGMHh6jh2MyUM8M_v__BdJPk_Svdeb0Yh0sVsuxSvp80tvYm-OTXoffUEomBdx-W8Ht3bpc3kkKnD0AKtOqIg |
| CitedBy_id | crossref_primary_10_1109_TVCG_2015_2467992 crossref_primary_10_1111_j_1467_8659_2011_01951_x crossref_primary_10_1111_j_1467_8659_2012_03119_x crossref_primary_10_1080_0144929X_2019_1690578 crossref_primary_10_1109_TVCG_2022_3153895 crossref_primary_10_1177_1473871615605347 crossref_primary_10_1016_j_jvlc_2013_08_006 crossref_primary_10_1111_cgf_14814 crossref_primary_10_1016_j_jvlc_2013_08_009 crossref_primary_10_1109_TVCG_2013_76 crossref_primary_10_1007_s00373_021_02417_3 crossref_primary_10_1109_TVCG_2011_56 crossref_primary_10_1109_TVCG_2014_2346422 crossref_primary_10_1109_TVCG_2020_3047111 crossref_primary_10_4018_irmj_2014010105 crossref_primary_10_1109_TVCG_2014_2315995 crossref_primary_10_1016_j_jvlc_2012_02_001 crossref_primary_10_1109_TVCG_2010_119 crossref_primary_10_1016_j_aam_2017_10_002 crossref_primary_10_1109_TVCG_2011_186 crossref_primary_10_1109_TVCG_2011_143 crossref_primary_10_1007_s10849_015_9230_7 crossref_primary_10_1016_j_jvlc_2011_07_001 crossref_primary_10_1109_TVCG_2013_184 crossref_primary_10_1109_TVCG_2021_3074615 crossref_primary_10_1111_cgf_12093 crossref_primary_10_1109_TVCG_2016_2598496 crossref_primary_10_1109_TVCG_2023_3261934 crossref_primary_10_1186_1471_2105_15_201 crossref_primary_10_1016_j_jda_2011_12_009 crossref_primary_10_1109_TVCG_2024_3456367 crossref_primary_10_2196_40805 crossref_primary_10_1007_s10849_021_09331_0 crossref_primary_10_1109_TVCG_2014_2346249 crossref_primary_10_1111_cgf_15089 crossref_primary_10_1109_TVCG_2021_3114761 crossref_primary_10_1109_TVCG_2022_3209482 crossref_primary_10_1111_cgf_12722 crossref_primary_10_1145_2810012 crossref_primary_10_1111_cgf_12643 crossref_primary_10_1109_TVCG_2009_84 crossref_primary_10_1109_TVCG_2013_232 crossref_primary_10_1186_s12859_015_0550_z crossref_primary_10_1111_j_1467_8659_2011_01956_x crossref_primary_10_1109_TVCG_2015_2424878 crossref_primary_10_1007_s10849_017_9250_6 crossref_primary_10_1111_j_1467_8659_2012_03080_x crossref_primary_10_1109_TVCG_2011_288 crossref_primary_10_1007_s12650_014_0271_9 crossref_primary_10_1109_TVCG_2020_3030475 crossref_primary_10_1109_TVCG_2021_3114870 crossref_primary_10_1109_TVCG_2020_3030471 crossref_primary_10_1109_TVCG_2023_3326599 crossref_primary_10_1109_TVCG_2022_3209485 crossref_primary_10_1002_sam_11146 crossref_primary_10_1109_TVCG_2021_3114759 crossref_primary_10_1109_TVCG_2013_65 crossref_primary_10_1109_MCG_2010_101 crossref_primary_10_1109_TVCG_2010_210 crossref_primary_10_1016_j_jvlc_2016_10_006 |
| Cites_doi | 10.1007/3-540-46648-7_36 10.1007/BF02122694 10.1145/1409720.1409757 10.1093/comjnl/10.1.85 10.1007/11783183_14 10.1109/IV.2009.30 10.1109/IV.2008.57 10.1007/978-3-540-25931-2_13 10.1007/3-540-46037-3_6 10.1016/j.jvlc.2008.01.004 10.1038/nature03607 |
| 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. Distributed under a Creative Commons Attribution 4.0 International License |
| 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. – 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.2009.01452.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 | Technology Research Database Computer and Information Systems Abstracts CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1467-8659 |
| EndPage | 974 |
| ExternalDocumentID | oai:HAL:hal-00407269v1 1810708591 10_1111_j_1467_8659_2009_01452_x CGF1452 ark_67375_WNG_WXH6FX72_4 |
| 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-c4432-2167f0717e38294bf4be3983e4cf5928d3fee0f7b6335c67f74dbdd2b8ba20803 |
| IEDL.DBID | DRFUL |
| ISICitedReferencesCount | 74 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000268217500034&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:46:07 EDT 2025 Fri Sep 05 10:26:41 EDT 2025 Fri Jul 25 04:53:10 EDT 2025 Sat Nov 29 03:41:03 EST 2025 Tue Nov 18 22:18:33 EST 2025 Sun Sep 21 06:19:33 EDT 2025 Tue Nov 11 03:33:49 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-c4432-2167f0717e38294bf4be3983e4cf5928d3fee0f7b6335c67f74dbdd2b8ba20803 |
| Notes | istex:08CC38090192529D610D08849CA001E19179BCAB ArticleID:CGF1452 ark:/67375/WNG-WXH6FX72-4 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| ORCID | 0000-0002-1114-8612 |
| OpenAccessLink | https://hal.science/hal-00407269 |
| PQID | 194681511 |
| PQPubID | 30877 |
| PageCount | 8 |
| ParticipantIDs | hal_primary_oai_HAL_hal_00407269v1 proquest_miscellaneous_34752481 proquest_journals_194681511 crossref_citationtrail_10_1111_j_1467_8659_2009_01452_x crossref_primary_10_1111_j_1467_8659_2009_01452_x wiley_primary_10_1111_j_1467_8659_2009_01452_x_CGF1452 istex_primary_ark_67375_WNG_WXH6FX72_4 |
| 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 Wiley |
| Publisher_xml | – name: Blackwell Publishing Ltd – name: Wiley |
| References | De Fraysseix H., Pach J., Pollack R.: How to draw a planar graph on a grid. Combinatorica 10, (1990), 41-51. Ware C.: Information Visualization: Perception for Design. Morgan Kaufmann Publishers, San Francisco , 2000. Palla G., Derényi I., Farkas I., Vicsek T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435, (2005), 814-818. Rodgers P., Zhang L., Fish A.: General Euler diagram generation. vol. 5223, Springer, pp. 13-27. Simonetto P., Auber D.: An heuristic for the construction of intersection graphs. In IV09 (July 2009), IEEE Computer Society. Bader G. D., Hogue C. W.: An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics 4, 2 (Jan. 13 2003), 27. Flower J., Fish A., Howse J.: Euler diagram generation. Journal of Visual Languages and Computing 19 (Dec. 2008), 675-694. Koenig P.-Y., Melançon G., Bohan C., Gautier B.: Combining DagMaps and Sugiyama layout for the navigation of hierarchical data. In IV (2007), IEEE Computer Society, pp. 447-452. Simonetto P., Auber D.: Visualise undrawable Euler diagrams. In IV08 (July 2008), IEEE Computer Society, pp. 594-599. Flower J., Howse J.: Generating Euler diagrams. Lecture Notes in Computer Science 2317 (2002). Welsh D., Powell M.: An upper bound for the chromatic number of a graph and its application to timetabling problems. The Computer Journal 10, 1 (1967), 85-86. 1990; 10 5223 2007; IV 2002; 2317 2000 1967; 10 Jan. 13 2003; 4 2005; 435 2008 2007 Dec. 2008; 19 2006 July 2009; IV09 2005 2004 1761 1991 July 2008; IV08 1999 e_1_2_8_16_2 e_1_2_8_19_2 e_1_2_8_12_2 e_1_2_8_23_2 Koenig P.‐Y. (e_1_2_8_13_2) 2007 e_1_2_8_14_2 e_1_2_8_9_2 Ware C. (e_1_2_8_22_2) 2000 Rodgers P. (e_1_2_8_15_2) e_1_2_8_2_2 Simonetto P. (e_1_2_8_18_2) 2009 e_1_2_8_4_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 e_1_2_8_20_2 e_1_2_8_10_2 e_1_2_8_21_2 e_1_2_8_11_2 Bader G. D. (e_1_2_8_3_2) 2003; 4 Simonetto P. (e_1_2_8_17_2) 2008 |
| References_xml | – reference: Rodgers P., Zhang L., Fish A.: General Euler diagram generation. vol. 5223, Springer, pp. 13-27. – reference: Palla G., Derényi I., Farkas I., Vicsek T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435, (2005), 814-818. – reference: Welsh D., Powell M.: An upper bound for the chromatic number of a graph and its application to timetabling problems. The Computer Journal 10, 1 (1967), 85-86. – reference: Simonetto P., Auber D.: An heuristic for the construction of intersection graphs. In IV09 (July 2009), IEEE Computer Society. – reference: Bader G. D., Hogue C. W.: An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics 4, 2 (Jan. 13 2003), 27. – reference: De Fraysseix H., Pach J., Pollack R.: How to draw a planar graph on a grid. Combinatorica 10, (1990), 41-51. – reference: Simonetto P., Auber D.: Visualise undrawable Euler diagrams. In IV08 (July 2008), IEEE Computer Society, pp. 594-599. – reference: Flower J., Fish A., Howse J.: Euler diagram generation. Journal of Visual Languages and Computing 19 (Dec. 2008), 675-694. – reference: Ware C.: Information Visualization: Perception for Design. Morgan Kaufmann Publishers, San Francisco , 2000. – reference: Flower J., Howse J.: Generating Euler diagrams. Lecture Notes in Computer Science 2317 (2002). – reference: Koenig P.-Y., Melançon G., Bohan C., Gautier B.: Combining DagMaps and Sugiyama layout for the navigation of hierarchical data. In IV (2007), IEEE Computer Society, pp. 447-452. – start-page: 585 year: 2008 end-page: 593 – volume: IV09 year: July 2009 – year: 2005 – volume: 19 start-page: 675 year: Dec. 2008 end-page: 694 article-title: Euler diagram generation publication-title: Journal of Visual Languages and Computing – volume: IV start-page: 447 year: 2007 end-page: 452 – year: 2007 – start-page: 161 year: 2006 end-page: 167 – year: 1761 – year: 2000 – volume: 4 start-page: 27 issue: 2 year: Jan. 13 2003 article-title: An automated method for finding molecular complexes in large protein interaction networks publication-title: BMC Bioinformatics – volume: 10 start-page: 41 year: 1990 end-page: 51 article-title: How to draw a planar graph on a grid publication-title: Combinatorica – volume: 2317 year: 2002 article-title: Generating Euler diagrams publication-title: Lecture Notes in Computer Science – volume: IV08 start-page: 594 year: July 2008 end-page: 599 – start-page: 205 year: 2008 end-page: 206 – volume: 5223 start-page: 13 end-page: 27 – start-page: 128 year: 2004 end-page: 141 – start-page: 284 year: 1991 end-page: 291 – volume: 10 start-page: 85 issue: 1 year: 1967 end-page: 86 article-title: An upper bound for the chromatic number of a graph and its application to timetabling problems publication-title: The Computer Journal – start-page: 351 year: 1999 end-page: 358 – volume: 435 start-page: 814 year: 2005 end-page: 818 article-title: Uncovering the overlapping community structure of complex networks in nature and society publication-title: Nature – start-page: 13 volume-title: General Euler diagram generation ident: e_1_2_8_15_2 – start-page: 447 volume-title: Combining DagMaps and Sugiyama layout for the navigation of hierarchical data year: 2007 ident: e_1_2_8_13_2 – ident: e_1_2_8_2_2 doi: 10.1007/3-540-46648-7_36 – ident: e_1_2_8_5_2 – start-page: 594 volume-title: Visualise undrawable Euler diagrams year: 2008 ident: e_1_2_8_17_2 – ident: e_1_2_8_6_2 doi: 10.1007/BF02122694 – ident: e_1_2_8_4_2 doi: 10.1145/1409720.1409757 – ident: e_1_2_8_11_2 – ident: e_1_2_8_20_2 – ident: e_1_2_8_19_2 – ident: e_1_2_8_23_2 doi: 10.1093/comjnl/10.1.85 – ident: e_1_2_8_10_2 doi: 10.1007/11783183_14 – volume-title: An heuristic for the construction of intersection graphs year: 2009 ident: e_1_2_8_18_2 doi: 10.1109/IV.2009.30 – ident: e_1_2_8_16_2 doi: 10.1109/IV.2008.57 – ident: e_1_2_8_7_2 – ident: e_1_2_8_21_2 doi: 10.1007/978-3-540-25931-2_13 – ident: e_1_2_8_9_2 doi: 10.1007/3-540-46037-3_6 – volume: 4 start-page: 27 issue: 2 year: 2003 ident: e_1_2_8_3_2 article-title: An automated method for finding molecular complexes in large protein interaction networks publication-title: BMC Bioinformatics – ident: e_1_2_8_12_2 – ident: e_1_2_8_8_2 doi: 10.1016/j.jvlc.2008.01.004 – volume-title: Information Visualization: Perception for Design year: 2000 ident: e_1_2_8_22_2 – ident: e_1_2_8_14_2 doi: 10.1038/nature03607 |
| SSID | ssj0004765 |
| Score | 2.2637112 |
| Snippet | Visualisation of taxonomies and sets has recently become an active area of research. Many application fields now require more than a strict classification of... |
| SourceID | hal proquest crossref wiley istex |
| SourceType | Open Access Repository Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 967 |
| SubjectTerms | Computer graphics Computer Science Eulers equations I.3.3 [Computer Graphics]: Picture/Image Generation-Display algorithms Information Retrieval Readability Studies Taxonomy Visualization |
| Title | Fully Automatic Visualisation of Overlapping Sets |
| URI | https://api.istex.fr/ark:/67375/WNG-WXH6FX72-4/fulltext.pdf https://onlinelibrary.wiley.com/doi/abs/10.1111%2Fj.1467-8659.2009.01452.x https://www.proquest.com/docview/194681511 https://www.proquest.com/docview/34752481 https://hal.science/hal-00407269 |
| Volume | 28 |
| WOSCitedRecordID | wos000268217500034&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/eLvHCXMwrV3fb9MwED5BywM88BtRxiBCiLegxHZs57HalvVhKggY65tlJ_aYQC1q2mr897tL0rAKHibEW-ScreR8Z3-2z98BvA2eaSeljYPKRCysRJfCkjgkTlU4KCOosE2yCTWd6tks_9jFP9FdmJYfot9wI89oxmtycOvqP51cyyzvaCdTkbH3iCeHDM1YDGB4-Kk4Pfl9S1LJbMv0TRwyu3E9f21rZ7K6_Y1CJYek_csdPHod1TbTUvHgf_7QQ7jfgdNo3FrTI7jl54_h3jXKwieQ0pr1VzRerxYN2Wv09aKme5ltUFC0CNGHDW0REu3DefTZr-qncFocfTmYxF3ahbgUgrOYoYICLfM81ywXLgjnea65F2XIsCMrHrxPgnKS86xEWSUqV1XMaWcZAlD-DAbzxdw_h8ilKvHSB5doIbCJvFRphbZhEytLV_IRqK1-TdlxklNqjB9mZ22iDCmFMmbmplGKuRxB2tf82fJy3KDOG-zCXpyItSfjE0NlNJYpJvNNOoJ3TQ_3Ynb5nYLfVGbOpsfmbDaRxUwxI0awtzUB0_l9bdJcSI0gCpt53b9Fh6VTGDv3i3VtuFAZExolZGMNN_58c3Bc0NOLf624B3fbszDaQ3oJg9Vy7ffhTrlZXdTLV527XAHhsw8r |
| linkProvider | Wiley-Blackwell |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3db9MwED-NFgl42PgYooyxCCHeghJ_57HayDrRdQg21jcrTmyYQC1q2mr77-dL0mwVe5gQb5FztpLznX13Pv8O4L2zRBkhstBJzkKWCa9SviV0kZGFX5S9UZFVxSbkaKTG4-RLUw4I78LU-BBtwA01o1qvUcExIP23livBkwZ3MmacfPQGZZd5qeId6B58Tc-GN9ckpeArqG8EkVlP7LlzrLXd6sFPzJXsIvsv1wzS22ZttS-lW__1j57CZmOeBv1anp7Bhp08hye3QAtfQIxe61XQX8ynFdxr8P2ixJuZdVpQMHXByRKDhAj88CP4ZuflNpyln073B2FTeCHMGaMkJJ5DDh09SxVJmHHMWJooalnuuJ_KgjprIyeNoJTnnlaywhQFMcpkxJug9CV0JtOJfQWBiWVkhXUmUoz5IZJcxoWXjizKRG5y2gO5YrDOG1RyLI7xW695J1IjU7BmZqIrpujLHsRtzz81Msc9-rzzc9iSI7T2oD_U2IarmSQiWcY9-FBNcUuWzX5h-pvk-nx0qM_HA5GOJdGsBzsrGdCN5pc6TphQ3ozyw-y1b73K4jlMNrHTRakpk5ww5SlEJQ73_ny9f5ji0-t_7bgHjwanx0M9PBp93oHH9ckYRpTeQGc-W9hdeJgv5xfl7G2jO9c2lhMb |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3db9MwELdgRWh74HuiDFiEEG9Bib_9WG1kRVRlAsb6ZsWJzaahdmraavvvuUvSsAoeJsRb5Jyt5Hw_-2yff0fI2-CpdlLmcVCCxzyXACkoiUPiVAmDMjgVeZ1sQo3HejIxx206ILwL0_BDdBtuiIx6vEaA-8sy_IlyLYVpeSdTLuh7cCh7XBgJKO0dfslORr-vSSop1lTfSCKzGdjz17Y2Zqu7Zxgr2UP1X204pDfd2npeyh7-1z96RB607mk0aOzpMbnjp0_Izg3SwqckxVXrdTRYLmY13Wv0_bzCm5lNWFA0C9HnFW4SIvHDj-irX1TPyEn24dvBMG4TL8QF54zGFDQUcKHnmaaGu8CdZ0Yzz4sgoCtLFrxPgnKSMVGArOKlK0vqtMspuKBsl2xNZ1P_nEQuVYmXPrhEcw5NmEKlJVhHnuSycAXrE7VWsC1aVnJMjvHTbqxOlEWlYM5MY2ul2Ks-Sbualw0zxy3qvIE-7MSRWns4GFksw9FMUWlWaZ-8q7u4E8vnFxj-poQ9HR_Z08lQZhNFLe-TvbUN2Bb5lU0NlxrcKGhmv3sLkMVzmHzqZ8vKMq4E5RokZG0Ot_58e3CU4dOLf624T-4fH2Z29HH8aY9sNwdjuKH0kmwt5kv_itwrVovzav66hc4vocYSlg |
| 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=Fully+Automatic+Visualisation+of+Overlapping+Sets&rft.jtitle=Computer+graphics+forum&rft.au=Simonetto%2C+Paolo&rft.au=Auber%2C+David&rft.au=Archambault%2C+Daniel&rft.date=2009-06-01&rft.issn=0167-7055&rft.eissn=1467-8659&rft.volume=28&rft.issue=3&rft.spage=967&rft.epage=974&rft_id=info:doi/10.1111%2Fj.1467-8659.2009.01452.x&rft.externalDBID=n%2Fa&rft.externalDocID=10_1111_j_1467_8659_2009_01452_x |
| 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 |