Random Accessible Hierarchical Mesh Compression for Interactive Visualization
This paper presents a novel algorithm for hierarchical random accessible mesh decompression. Our approach progressively decompresses the requested parts of a mesh without decoding less interesting parts. Previous approaches divided a mesh into independently compressed charts and a base coarse mesh....
Gespeichert in:
| Veröffentlicht in: | Computer graphics forum Jg. 28; H. 5; S. 1311 - 1318 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
Oxford, UK
Blackwell Publishing Ltd
01.07.2009
Wiley |
| Schlagworte: | |
| ISSN: | 0167-7055, 1467-8659 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | This paper presents a novel algorithm for hierarchical random accessible mesh decompression. Our approach progressively decompresses the requested parts of a mesh without decoding less interesting parts. Previous approaches divided a mesh into independently compressed charts and a base coarse mesh. We propose a novel hierarchical representation of the mesh. We build this representation by using a boundary‐based approach to recursively split the mesh in two parts, under the constraint that any of the two resulting submeshes should be reconstructible independently.
In addition to this decomposition technique, we introduce the concepts of opposite vertex and context dependant numbering. This enables us to achieve seemingly better compression ratios than previous work on quad and higher degree polygonal meshes. Our coder uses about 3 bits per polygon for connectivity and 14 bits per vertex for geometry using 12 bits quantification. |
|---|---|
| AbstractList | This paper presents a novel algorithm for hierarchical random accessible mesh decompression. Our approach progressively decompresses the requested parts of a mesh without decoding less interesting parts. Previous approaches divided a mesh into independently compressed charts and a base coarse mesh. We propose a novel hierarchical representation of the mesh. We build this representation by using a boundary-based approach to recursively split the mesh in two parts, under the constraint that any of the two resulting submeshes should be reconstructible independently. In addition to this decomposition technique, we introduce the concepts of opposite vertex and context dependant numbering. This enables us to achieve seemingly better compression ratios than previous work on quad and higher degree polygonal meshes. Our coder uses about 3 bits per polygon for connectivity and 14 bits per vertex for geometry using 12 bits quantification. [PUBLICATION ABSTRACT] This paper presents a novel algorithm for hierarchical random accessible mesh decompression. Our approach progressively decompresses the requested parts of a mesh without decoding less interesting parts. Previous approaches divided a mesh into independently compressed charts and a base coarse mesh. We propose a novel hierarchical representation of the mesh. We build this representation by using a boundary‐based approach to recursively split the mesh in two parts, under the constraint that any of the two resulting submeshes should be reconstructible independently. In addition to this decomposition technique, we introduce the concepts of opposite vertex and context dependant numbering . This enables us to achieve seemingly better compression ratios than previous work on quad and higher degree polygonal meshes. Our coder uses about 3 bits per polygon for connectivity and 14 bits per vertex for geometry using 12 bits quantification. This paper presents a novel algorithm for hierarchical random accessible mesh decompression. Our approach progressively decompresses the requested parts of a mesh without decoding less interesting parts. Previous approaches divided a mesh into independently compressed charts and a base coarse mesh. We propose a novel hierarchical representation of the mesh. We build this representation by using a boundary-based approach to recursively split the mesh in two parts, under the constraint that any of the two resulting submeshes should be reconstructible independently. In addition to this decomposition technique, we introduce the concepts of opposite vertex and context dependant numbering. This enables us to achieve seemingly better compression ratios than previous work on quad and higher degree polygonal meshes. Our coder uses about 3 bits per polygon for connectivity and 14 bits per vertex for geometry using 12 bits quantification. This paper presents a novel algorithm for hierarchical random accessible mesh decompression. Our approach progressively decompresses the requested parts of a mesh without decoding less interesting parts. Previous approaches divided a mesh into independently compressed charts and a base coarse mesh. We propose a novel hierarchical representation of the mesh. We build this representation by using a boundary‐based approach to recursively split the mesh in two parts, under the constraint that any of the two resulting submeshes should be reconstructible independently. In addition to this decomposition technique, we introduce the concepts of opposite vertex and context dependant numbering. This enables us to achieve seemingly better compression ratios than previous work on quad and higher degree polygonal meshes. Our coder uses about 3 bits per polygon for connectivity and 14 bits per vertex for geometry using 12 bits quantification. |
| Author | Hudelot, Celine Courbet, Clement |
| Author_xml | – sequence: 1 givenname: Clement surname: Courbet fullname: Courbet, Clement – sequence: 2 givenname: Celine surname: Hudelot fullname: Hudelot, Celine |
| BackLink | https://hal.science/hal-00825268$$DView record in HAL |
| BookMark | eNqNkcFr2zAUxsXoYGnX_8HsMNjBnmRLsnzYIIQmKaQdjLbb7aHIz0SZY2WS06X76yfXaw89VRc99P2-D733TslJ5zokJGE0Y_F83maMyzJVUlRZTmmVUSaoyo5vyORZOCETymJdUiHekdMQtpRSXkoxIVffdVe7XTI1BkOw6xaTpUWvvdlYo9vkCsMmmbnd3g-y65LG-eSy6yNienuPyZ0NB93av7qP6nvyttFtwPP_9xm5nV_czJbp6tvicjZdpYbzQqU55lVhGlZz1jS1pJzna1pL1DUWDMuy4pxXpWRGy0JrqtYNSrGupagxkswUZ-TTmLvRLey93Wn_AE5bWE5XMLxRqnKRS3XPIvtxZPfe_T5g6GFng8G21R26Q4CCVzmjqojghxfg1h18F_sAVnGphJAyQl9HyHgXgscGjO0fe--9ti0wCsNaYAvD9GGYPgxrgce1wDEGqBcBT_9_hfXLaP1jW3x4tQ9mi_lQRX86-m3o8fjs1_4XyLIoBfy4XoD4WVI1r3JgxT99GbUA |
| CitedBy_id | crossref_primary_10_1111_j_1467_8659_2011_01866_x crossref_primary_10_1016_j_cag_2013_05_005 crossref_primary_10_1111_j_1467_8659_2012_03221_x crossref_primary_10_1111_cgf_15002 crossref_primary_10_1109_TCSVT_2018_2860525 crossref_primary_10_1016_j_cag_2012_03_023 crossref_primary_10_1111_j_1467_8659_2012_03154_x crossref_primary_10_1109_TVCG_2013_81 |
| Cites_doi | 10.1109/2945.841122 10.1109/TVCG.2004.1260763 10.1093/comjnl/29.5.472 10.1145/280814.280834 10.1111/j.1467-8659.2006.00951.x 10.1007/11534273_13 10.1145/344779.344919 10.1016/j.jvcir.2005.03.001 10.1007/3-540-26808-1_1 10.1006/gmod.2002.0575 10.1145/237748.237750 10.1145/383259.383281 10.1111/1467-8659.t01-1-00598 10.1145/344779.344922 10.1109/TVCG.2007.70585 10.1145/344779.344924 10.1145/237170.237216 10.1145/563274.563323 |
| ContentType | Journal Article Conference Proceeding |
| 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 |
| DOI | 10.1111/j.1467-8659.2009.01508.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) |
| 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 CrossRef Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1467-8659 |
| EndPage | 1318 |
| ExternalDocumentID | oai:HAL:hal-00825268v1 1852597721 10_1111_j_1467_8659_2009_01508_x CGF1508 ark_67375_WNG_5X708F92_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 AAHHS ACCFJ ADZOD AEEZP AEQDE AEUQT AFPWT AIWBW AJBDE ALUQN WRC AAYXX CITATION O8X 7SC 8FD JQ2 L7M L~C L~D F28 FR3 1XC |
| ID | FETCH-LOGICAL-c4438-2e293cf1d41ffd60442b0d6eade31e7794449761ca63aa08bfe65bd65de42b1c3 |
| IEDL.DBID | DRFUL |
| ISICitedReferencesCount | 7 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000268597500007&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:17:44 EDT 2025 Sun Nov 09 13:52:38 EST 2025 Sun Nov 09 08:50:28 EST 2025 Sat Nov 29 03:41:04 EST 2025 Tue Nov 18 20:46:22 EST 2025 Wed Jan 22 17:03:58 EST 2025 Tue Nov 11 03:31:08 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Language | English |
| License | Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | DirectLink |
| MeetingName | Computer Graphics Forum- Proceedings of Eurographics Symposium on Geometry Processing 2009 |
| MergedId | FETCHMERGED-LOGICAL-c4438-2e293cf1d41ffd60442b0d6eade31e7794449761ca63aa08bfe65bd65de42b1c3 |
| Notes | ark:/67375/WNG-5X708F92-1 istex:4AB5235B5E0B957B97E7F89FEDEA007B65C9B1B1 ArticleID:CGF1508 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| ORCID | 0000-0003-3849-4133 |
| PQID | 194685566 |
| PQPubID | 30877 |
| PageCount | 8 |
| ParticipantIDs | hal_primary_oai_HAL_hal_00825268v1 proquest_miscellaneous_34921083 proquest_journals_194685566 crossref_citationtrail_10_1111_j_1467_8659_2009_01508_x crossref_primary_10_1111_j_1467_8659_2009_01508_x wiley_primary_10_1111_j_1467_8659_2009_01508_x_CGF1508 istex_primary_ark_67375_WNG_5X708F92_1 |
| PublicationCentury | 2000 |
| PublicationDate | July 2009 |
| PublicationDateYYYYMMDD | 2009-07-01 |
| PublicationDate_xml | – month: 07 year: 2009 text: July 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 | Ramsey: Simplification of arbitrary polyhedral meshes. In IASTED Computer Graphics and Imaging 2003 (2003). 2001 2000 2003; 2003 2009 1976 1998 1986 1997 1996 2007 2006 2005 2004 2003 2002 Ramsey (e_1_2_6_23_2) 2003; 2003 e_1_2_6_18_2 e_1_2_6_19_2 e_1_2_6_12_2 e_1_2_6_13_2 e_1_2_6_10_2 e_1_2_6_11_2 e_1_2_6_16_2 e_1_2_6_17_2 e_1_2_6_14_2 e_1_2_6_15_2 e_1_2_6_20_2 e_1_2_6_8_2 e_1_2_6_7_2 e_1_2_6_9_2 e_1_2_6_4_2 e_1_2_6_3_2 e_1_2_6_6_2 e_1_2_6_5_2 e_1_2_6_24_2 e_1_2_6_2_2 e_1_2_6_22_2 e_1_2_6_21_2 e_1_2_6_26_2 e_1_2_6_25_2 |
| References_xml | – reference: Ramsey: Simplification of arbitrary polyhedral meshes. In IASTED Computer Graphics and Imaging 2003 (2003). – year: 2009 – year: 1986 – volume: 2003 year: 2003 article-title: Simplification of arbitrary polyhedral meshes publication-title: IASTED Computer Graphics and Imaging – year: 2005 – year: 2002 – year: 2001 – year: 2007 – year: 2006 – year: 2003 – year: 2004 – year: 1997 – year: 1996 – year: 2000 – year: 1976 – year: 1998 – ident: e_1_2_6_22_2 doi: 10.1109/2945.841122 – ident: e_1_2_6_16_2 – ident: e_1_2_6_5_2 – ident: e_1_2_6_10_2 – ident: e_1_2_6_25_2 doi: 10.1109/TVCG.2004.1260763 – ident: e_1_2_6_8_2 doi: 10.1093/comjnl/29.5.472 – ident: e_1_2_6_24_2 doi: 10.1145/280814.280834 – ident: e_1_2_6_13_2 doi: 10.1111/j.1467-8659.2006.00951.x – ident: e_1_2_6_6_2 – ident: e_1_2_6_3_2 doi: 10.1007/11534273_13 – ident: e_1_2_6_11_2 doi: 10.1145/344779.344919 – ident: e_1_2_6_15_2 – ident: e_1_2_6_20_2 – ident: e_1_2_6_21_2 doi: 10.1016/j.jvcir.2005.03.001 – ident: e_1_2_6_4_2 doi: 10.1007/3-540-26808-1_1 – ident: e_1_2_6_12_2 doi: 10.1006/gmod.2002.0575 – ident: e_1_2_6_19_2 doi: 10.1145/237748.237750 – ident: e_1_2_6_2_2 doi: 10.1145/383259.383281 – ident: e_1_2_6_18_2 doi: 10.1111/1467-8659.t01-1-00598 – ident: e_1_2_6_17_2 doi: 10.1145/344779.344922 – ident: e_1_2_6_26_2 doi: 10.1109/TVCG.2007.70585 – ident: e_1_2_6_14_2 doi: 10.1145/344779.344924 – ident: e_1_2_6_9_2 doi: 10.1145/237170.237216 – ident: e_1_2_6_7_2 doi: 10.1145/563274.563323 – volume: 2003 year: 2003 ident: e_1_2_6_23_2 article-title: Simplification of arbitrary polyhedral meshes publication-title: IASTED Computer Graphics and Imaging |
| SSID | ssj0004765 |
| Score | 1.9085842 |
| Snippet | This paper presents a novel algorithm for hierarchical random accessible mesh decompression. Our approach progressively decompresses the requested parts of a... |
| SourceID | hal proquest crossref wiley istex |
| SourceType | Open Access Repository Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 1311 |
| SubjectTerms | and object representations Computer graphics Computer Science Data compression E.4 [Coding and Information Theory]: Data compaction and compression Graphics Hierarchies I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling-Curve I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling—Curve, surface, solid, and object representations solid Studies surface Visualization |
| Title | Random Accessible Hierarchical Mesh Compression for Interactive Visualization |
| URI | https://api.istex.fr/ark:/67375/WNG-5X708F92-1/fulltext.pdf https://onlinelibrary.wiley.com/doi/abs/10.1111%2Fj.1467-8659.2009.01508.x https://www.proquest.com/docview/194685566 https://www.proquest.com/docview/34921083 https://hal.science/hal-00825268 |
| Volume | 28 |
| WOSCitedRecordID | wos000268597500007&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/eLvHCXMwrV1Lb9QwEB7BLgc48EaE8rAQ4hYUJ34kx1Uh3cN2hSpa9mbZsaOuumSrTVv159fjZENXcKgQtyixo2Q8M_5sz3wD8MkUheMFN7GmqYyZNVWcW5HFFcXZIKNOhz3dk5mcz_PFovjexz9hLkzHDzFsuKFlBH-NBq5N-6eR54IXPe0kUpt_8XhynHo15iMYfz0qj2e_sySl4Fumb-SQ2Y3r-eu7diar-6cYKjlG6V_v4NHbqDZMS-WT__lDT-FxD07JpNOmZ3DPNc_h0S3KwhdweKQbu_5FJqHQ4tKsHJkuMYk51FRZkUPXnhJ0Ml18bUM8KCZh21EHz0pOli3mcXbZny_huPz2Y38a9yUZ4oox7xpT5-FBVVPLaF1bkTCWmsQKjLr24yq9cTPmAQ6ttMi0TnJTO8GNFdw635JW2SsYNevGvQaSZcZZYSTlxjCb2txRadLE-vVjLUzCIpBb2auq5yvHshkrtbNukQoFhtU0CxUEpq4joEPP846z4w59PvrhHZoj6fZ0MlN4L6yiU5Ff0Qg-h9EfmunNGQbGSa5-zg8UX8gkL4tU-YZ7W_VQvU9oFS2YyLmHzxF8GJ56Y8YTGt249WWrkCqSelAcgQiacufPV_sHJV69-deOe_CwOyfDQOS3MLrYXLp38KC6uli2m_e9Kd0Auo0ZbA |
| linkProvider | Wiley-Blackwell |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3db9MwED_BigQ88I0IA2YhxFtQnPgjeawGWRFphaZt9M2KY0er6NKp2ab9-ficNKyChwnxFiV2lNh355_Pd78D-KCzzPKM67CksQyZ0VWYGpGEFcXVIKG29D7dk0LOZul8nn3vywFhLkzHDzE43FAzvL1GBUeH9J9angqe9byTyG3-yQHKEXNS5cR99PkwPy5-p0lKwTdU30gisx3Y89d3ba1Wd08xVnKEw3-9BUhvwlq_LuWP_-sfPYFHPTwl406ensId2zyDhzdIC5_D9LBszOqMjH2pxYVeWjJZYBqzr6qyJFPbnhI0M12EbUMcLCbe8Vh620pOFi1mcnb5ny_gOP9ytD8J-6IMYcWYM46xdQChqqlhtK6NiBiLdWQExl27mZVOvRlzEIdWpUjKMkp1bQXXRnBjXUtaJS9hp1k19hWQJNHWCC0p15qZ2KSWSh1Hxu0ga6EjFoDcDL6qesZyLJyxVFs7F6lwwLCeZqb8gKnrAOjQ87xj7bhFn_dufofmSLs9GRcK7_l9dCzSKxrARz_9Q7Ny_RND4yRXP2YHis9llOZZrFzD3Y18qN4qtIpmTKTcAegA9oanTp3xjKZs7OqyVUgWSR0sDkB4Ubn156v9gxyvXv9rxz24PzmaFqr4Ovu2Cw-6UzMMS34DOxfrS_sW7lVXF4t2_a7Xq1-l4R1c |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3db9MwED9BixA88I0IG8xCiLegOPFH8lhty4roqmlio29WHDtaRUmnZpv25-Nz0rBqe5gQb1FyjpKz7_yzffc7gM86yyzPuA4LGsuQGV2GqRFJWFKcDRJqC7-nezqR02k6m2VHXTkgzIVp-SH6DTe0DO-v0cDtualuW3kqeNbxTiK3-VcHKIcMa8oMYLh3nJ9M_qZJSsHXVN9IIrMZ2HPnuzZmq4dnGCs5RPVfbwDSm7DWz0v58__6Ry_gWQdPyagdTy_hga1fwdMbpIWv4fC4qM3yNxn5UotzvbBkPMc0Zl9VZUEObXNG0M20EbY1cbCY-I3HwvtWcjpvMJOzzf98Ayf5_o_dcdgVZQhLxpxzjK0DCGVFDaNVZUTEWKwjIzDu2vWsdObNmIM4tCxEUhRRqisruDaCG-skaZm8hUG9rO07IEmirRFaUq41M7FJLZU6joxbQVZCRywAuVa-KjvGciycsVAbKxepUGFYTzNTXmHqOgDatzxvWTvu0eaT699eHGm3x6OJwnt-HR2L9IoG8MV3fy9WrH5haJzk6uf0QPGZjNI8i5UT3FqPD9V5hUbRjImUOwAdwE7_1JkzntEUtV1eNgrJIqmDxQEIP1Tu_flq9yDHq_f_2nAHHh_t5Wrybfp9C560h2YYlbwNg4vVpf0Aj8qri3mz-tiZ1R8CZBzX |
| 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=proceeding&rft.title=Computer+graphics+forum&rft.atitle=Random+Accessible+Hierarchical+Mesh+Compression+for+Interactive+Visualization&rft.au=Courbet%2C+Clement&rft.au=Hudelot%2C+C%C3%A9line&rft.date=2009-07-01&rft.pub=Wiley&rft.issn=0167-7055&rft.eissn=1467-8659&rft.volume=28&rft.issue=5&rft.spage=1311&rft.epage=1318&rft_id=info:doi/10.1111%2Fj.1467-8659.2009.01508.x&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai%3AHAL%3Ahal-00825268v1 |
| 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 |