End‐to‐End Compressed Meshlet Rendering
In this paper, we study rendering of end‐to‐end compressed triangle meshes using modern GPU techniques, in particular, mesh shaders. Our approach allows us to keep unstructured triangle meshes in GPU memory in compressed form and decompress them in shader code just in time for rasterization. Typical...
Uloženo v:
| Vydáno v: | Computer graphics forum Ročník 43; číslo 1 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Oxford
Blackwell Publishing Ltd
01.02.2024
|
| 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 | In this paper, we study rendering of end‐to‐end compressed triangle meshes using modern GPU techniques, in particular, mesh shaders. Our approach allows us to keep unstructured triangle meshes in GPU memory in compressed form and decompress them in shader code just in time for rasterization. Typical previous approaches use a compressed mesh format only for persistent storage and streaming, but must decompress it into GPU memory before submitting it to rendering. In contrast, our approach uses an identical compressed format in both storage and GPU memory. Hence, our compression method effectively reduces the in‐memory requirements of huge triangular meshes and avoids any waiting times on streaming geometry induced by the need for a decompression stage on the CPU. End‐to‐end compression also means that scenes with more geometric detail than previously possible can be made fully resident in GPU memory. Our approach is based on a novel decomposition of meshes into meshlets, i.e. disjoint primitive groups that are compressed individually. Decompression using a mesh shader allows de facto random access on the primitive level, which is important for applications such as selective streaming and fine‐grained visibility computation. We compare our approach to multiple commonly used compressed meshlet formats in terms of required memory and rendering times. The results imply that our approach reduces the required CPU–GPU memory bandwidth, a frequent bottleneck in out‐of‐core rendering.
Our approach allows us to keep unstructured triangle meshes in GPU memory in compressed form and decompress them in the mesh shader just in time for rasterization. |
|---|---|
| AbstractList | In this paper, we study rendering of end‐to‐end compressed triangle meshes using modern GPU techniques, in particular, mesh shaders. Our approach allows us to keep unstructured triangle meshes in GPU memory in compressed form and decompress them in shader code just in time for rasterization. Typical previous approaches use a compressed mesh format only for persistent storage and streaming, but must decompress it into GPU memory before submitting it to rendering. In contrast, our approach uses an identical compressed format in both storage and GPU memory. Hence, our compression method effectively reduces the in‐memory requirements of huge triangular meshes and avoids any waiting times on streaming geometry induced by the need for a decompression stage on the CPU. End‐to‐end compression also means that scenes with more geometric detail than previously possible can be made fully resident in GPU memory. Our approach is based on a novel decomposition of meshes into meshlets, i.e. disjoint primitive groups that are compressed individually. Decompression using a mesh shader allows de facto random access on the primitive level, which is important for applications such as selective streaming and fine‐grained visibility computation. We compare our approach to multiple commonly used compressed meshlet formats in terms of required memory and rendering times. The results imply that our approach reduces the required CPU–GPU memory bandwidth, a frequent bottleneck in out‐of‐core rendering.
Our approach allows us to keep unstructured triangle meshes in GPU memory in compressed form and decompress them in the mesh shader just in time for rasterization. In this paper, we study rendering of end‐to‐end compressed triangle meshes using modern GPU techniques, in particular, mesh shaders. Our approach allows us to keep unstructured triangle meshes in GPU memory in compressed form and decompress them in shader code just in time for rasterization. Typical previous approaches use a compressed mesh format only for persistent storage and streaming, but must decompress it into GPU memory before submitting it to rendering. In contrast, our approach uses an identical compressed format in both storage and GPU memory. Hence, our compression method effectively reduces the in‐memory requirements of huge triangular meshes and avoids any waiting times on streaming geometry induced by the need for a decompression stage on the CPU. End‐to‐end compression also means that scenes with more geometric detail than previously possible can be made fully resident in GPU memory. Our approach is based on a novel decomposition of meshes into meshlets, i.e . disjoint primitive groups that are compressed individually. Decompression using a mesh shader allows de facto random access on the primitive level, which is important for applications such as selective streaming and fine‐grained visibility computation. We compare our approach to multiple commonly used compressed meshlet formats in terms of required memory and rendering times. The results imply that our approach reduces the required CPU–GPU memory bandwidth, a frequent bottleneck in out‐of‐core rendering. In this paper, we study rendering of end‐to‐end compressed triangle meshes using modern GPU techniques, in particular, mesh shaders. Our approach allows us to keep unstructured triangle meshes in GPU memory in compressed form and decompress them in shader code just in time for rasterization. Typical previous approaches use a compressed mesh format only for persistent storage and streaming, but must decompress it into GPU memory before submitting it to rendering. In contrast, our approach uses an identical compressed format in both storage and GPU memory. Hence, our compression method effectively reduces the in‐memory requirements of huge triangular meshes and avoids any waiting times on streaming geometry induced by the need for a decompression stage on the CPU. End‐to‐end compression also means that scenes with more geometric detail than previously possible can be made fully resident in GPU memory. Our approach is based on a novel decomposition of meshes into meshlets, i.e. disjoint primitive groups that are compressed individually. Decompression using a mesh shader allows de facto random access on the primitive level, which is important for applications such as selective streaming and fine‐grained visibility computation. We compare our approach to multiple commonly used compressed meshlet formats in terms of required memory and rendering times. The results imply that our approach reduces the required CPU–GPU memory bandwidth, a frequent bottleneck in out‐of‐core rendering. |
| Author | Steinberger, M. Mlakar, D. Schmalstieg, D. |
| Author_xml | – sequence: 1 givenname: D. surname: Mlakar fullname: Mlakar, D. email: daniel.mlakar@icg.tugraz.at organization: Graz University of Technology – sequence: 2 givenname: M. orcidid: 0000-0001-5977-8536 surname: Steinberger fullname: Steinberger, M. email: steinberger@icg.tugraz.at organization: Graz University of Technology – sequence: 3 givenname: D. surname: Schmalstieg fullname: Schmalstieg, D. email: dieter.schmalstieg@visus.uni-stuttgart.de organization: University of Stuttgart |
| BookMark | eNp9kM1KAzEUhYNUsK0ufIOCK5Fp8zNJJksZ2ipUBNF1yCSZOmWa1GSKdOcj-Iw-idFxJehd3HsW3zkXzggMnHcWgHMEpyjNTK_rKaIQ4iMwRDnjWcGoGIAhRElzSOkJGMW4gRDmnNEhuJo78_H23vm0kpyUfrsLNkZrJnc2Pre2mzxYZ2xo3PoUHNeqjfbs547B02L-WN5kq_vlbXm9yjQhGGdVoRmqcsMZqQUzjCtMSA6V5jmBQojcFqSqKOHWIFJgbY3ACmFGdVVxyAgZg4s-dxf8y97GTm78Prj0UmJBkOACU5qoy57SwccYbC13odmqcJAIyq8uZOpCfneR2NkvVjed6hrvuqCa9j_Ha9Paw9_Rslwuescn-Ihw8g |
| CitedBy_id | crossref_primary_10_1145_3731213 crossref_primary_10_3390_buildings14113622 crossref_primary_10_1016_j_compag_2025_110102 crossref_primary_10_1016_j_cag_2025_104292 |
| Cites_doi | 10.1145/280814.280836 10.1145/364338.364345 10.1177/0037549708093374 10.1111/j.1467-8659.2009.01508.x 10.1145/1230100.1230102 10.1016/S0925-7721(99)00026-7 10.1145/1276377.1276489 10.1109/VISUAL.2003.1250385 10.1080/2151237X.2012.641828 10.1145/311535.311565 10.1109/TVCG.2006.162 10.1145/218380.218391 10.1145/2010324.1964962 10.1109/CGI.2005.1500388 10.1109/TVCG.2008.64 10.1145/1730804.1730815 10.1109/2945.764870 10.1145/2366145.2366179 10.1109/VISUAL.2002.1183768 10.1109/TVCG.2006.59 10.1111/j.1467-8659.2012.03221.x 10.1145/280814.280855 10.1016/j.cad.2012.10.009 10.1111/j.1467-8659.2008.01298.x 10.1145/274363.274365 10.1109/TVCG.2017.2695182 10.1109/TVCG.2007.70516 10.1111/cgf.13246 10.1134/S0361768822030082 10.1145/2693443 10.1016/S0097-8493(99)00091-6 10.1145/1071866.1071876 10.1016/S0925-7721(01)00035-9 10.1109/PVGS.2003.1249044 10.1007/s00371-004-0255-1 10.1145/1073204.1073278 10.1111/j.1467-8659.2005.00872.x 10.1109/VISUAL.2005.1532800 10.1109/TVCG.2007.70585 10.1145/2856400.2856408 10.1109/VISUAL.1997.663902 10.1145/364338.364384 10.1145/1015706.1015799 |
| ContentType | Journal Article |
| Copyright | 2024 The Authors. published by Eurographics ‐ The European Association for Computer Graphics and John Wiley & Sons Ltd. 2024. This article is published under http://creativecommons.org/licenses/by-nc/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: 2024 The Authors. published by Eurographics ‐ The European Association for Computer Graphics and John Wiley & Sons Ltd. – notice: 2024. This article is published under http://creativecommons.org/licenses/by-nc/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | 24P AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1111/cgf.15002 |
| DatabaseName | Wiley Online Library Open Access 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 |
| 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 |
| DatabaseTitleList | CrossRef Computer and Information Systems Abstracts |
| Database_xml | – sequence: 1 dbid: 24P name: Wiley Online Library Open Access url: https://authorservices.wiley.com/open-science/open-access/browse-journals.html sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1467-8659 |
| EndPage | n/a |
| ExternalDocumentID | 10_1111_cgf_15002 CGF15002 |
| Genre | article |
| GroupedDBID | .3N .4S .DC .GA .Y3 05W 0R~ 10A 15B 1OB 1OC 24P 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 AITYG AIURR AJXKR AKVCP ALAGY ALMA_UNASSIGNED_HOLDINGS ALUQN ALVPJ AMBMR AMYDB ARCSS ASPBG ATUGU AUFTA AVWKF AZBYB AZFZN AZVAB BAFTC BDRZF BFHJK BHBCM BMNLL BMXJE BNHUX BROTX BRXPI 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 AAYXX AIQQE CITATION O8X 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c3322-b8c61b4d763f96d67a23340ac74309994e83bb537ed1382ced92a1265cbb70633 |
| IEDL.DBID | 24P |
| ISICitedReferencesCount | 6 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001148022600001&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 | Fri Jul 25 23:17:40 EDT 2025 Tue Nov 18 21:11:20 EST 2025 Sat Nov 29 03:41:23 EST 2025 Sun Jul 06 04:45:29 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Language | English |
| License | Attribution-NonCommercial |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c3322-b8c61b4d763f96d67a23340ac74309994e83bb537ed1382ced92a1265cbb70633 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0001-5977-8536 |
| OpenAccessLink | https://onlinelibrary.wiley.com/doi/abs/10.1111%2Fcgf.15002 |
| PQID | 2931979255 |
| PQPubID | 30877 |
| PageCount | 14 |
| ParticipantIDs | proquest_journals_2931979255 crossref_primary_10_1111_cgf_15002 crossref_citationtrail_10_1111_cgf_15002 wiley_primary_10_1111_cgf_15002_CGF15002 |
| PublicationCentury | 2000 |
| PublicationDate | February 2024 2024-02-00 20240201 |
| PublicationDateYYYYMMDD | 2024-02-01 |
| PublicationDate_xml | – month: 02 year: 2024 text: February 2024 |
| PublicationDecade | 2020 |
| PublicationPlace | Oxford |
| PublicationPlace_xml | – name: Oxford |
| PublicationTitle | Computer graphics forum |
| PublicationYear | 2024 |
| Publisher | Blackwell Publishing Ltd |
| Publisher_xml | – name: Blackwell Publishing Ltd |
| References | 2004; 20 2006; 12 2011 2010 2013; 45 2004; 23 1998 1997 2011; 30 1999; 23 2007 1995 2022; 48 2005 2003 2012; 16 2002 1999; 5 2007; 13 2012; 31 2005; 24 2001; 20 2009; 28 1999 2018; 24 2015; 47 1998; 17 2014; 3 2001 2023 2022 2000 2017; 36 2021 2020 1999; 14 2018 2016 2015 2008; 84 2009; 15 2007; 26 e_1_2_9_50_2 e_1_2_9_10_2 e_1_2_9_33_2 e_1_2_9_56_2 e_1_2_9_12_2 e_1_2_9_31_2 e_1_2_9_54_2 e_1_2_9_14_2 e_1_2_9_37_2 Meyer Q. (e_1_2_9_44_2) 2011 Touma C. (e_1_2_9_52_2) 1998 e_1_2_9_16_2 e_1_2_9_35_2 e_1_2_9_58_2 e_1_2_9_18_2 e_1_2_9_39_2 e_1_2_9_41_2 e_1_2_9_60_2 e_1_2_9_20_2 e_1_2_9_45_2 e_1_2_9_22_2 e_1_2_9_43_2 Cigolle Z. H. (e_1_2_9_5_2) 2014; 3 e_1_2_9_6_2 e_1_2_9_2_2 e_1_2_9_8_2 e_1_2_9_24_2 e_1_2_9_49_2 e_1_2_9_26_2 e_1_2_9_47_2 e_1_2_9_28_2 e_1_2_9_51_2 e_1_2_9_30_2 e_1_2_9_34_2 e_1_2_9_55_2 e_1_2_9_11_2 e_1_2_9_32_2 e_1_2_9_53_2 e_1_2_9_13_2 e_1_2_9_38_2 e_1_2_9_59_2 e_1_2_9_15_2 e_1_2_9_36_2 e_1_2_9_57_2 Calver D. (e_1_2_9_4_2) 2001 e_1_2_9_17_2 e_1_2_9_19_2 e_1_2_9_61_2 e_1_2_9_21_2 e_1_2_9_23_2 e_1_2_9_42_2 e_1_2_9_7_2 e_1_2_9_3_2 Lefebvre S. (e_1_2_9_40_2) 2007 e_1_2_9_9_2 e_1_2_9_25_2 e_1_2_9_48_2 e_1_2_9_27_2 e_1_2_9_46_2 e_1_2_9_29_2 |
| References_xml | – year: 2011 – volume: 20 start-page: 507 issue: 8‐9 year: 2004 end-page: 520 article-title: Delphi: Geometry‐based connectivity prediction in triangle mesh compression publication-title: The Visual Computer – volume: 16 start-page: 25 issue: 1 year: 2012 end-page: 39 article-title: Simple and efficient mesh layout with space‐filling curves publication-title: Journal of Graphics Tools – start-page: 269 year: 1999 end-page: 276 article-title: Optimization of mesh locality for transparent vertex caching – volume: 12 start-page: 640 issue: 4 year: 2006 end-page: 648 article-title: An improved vertex caching scheme for 3D mesh rendering publication-title: IEEE Transactions on Visualization and Computer Graphics – year: 2001 – start-page: 231 year: 2005 end-page: 238 article-title: Streaming meshes – volume: 23 start-page: 769 issue: 3 year: 2004 end-page: 776 article-title: Geometry clipmaps: Terrain rendering using nested regular grids publication-title: ACM Transactions on Graphics – volume: 24 start-page: 1705 year: 2018 end-page: 1716 article-title: Packing vertex data into hardware‐decompressible textures publication-title: IEEE Transactions on Visualization and Computer Graphics – volume: 26 start-page: 89 issue: 3 year: 2007 article-title: Fast triangle reordering for vertex locality and reduced overdraw publication-title: ACM Transactions on Graphics – volume: 30 start-page: 1 year: 2011 end-page: 8 article-title: Lr: Compact connectivity representation for triangle meshes publication-title: ACM Transactions on Graphics – year: 2021 article-title: Nanite—a deep dive – volume: 28 start-page: 1311 issue: 5 year: 2009 end-page: 1318 article-title: Random accessible hierarchical mesh compression for interactive visualization publication-title: Computer Graphics Forum – volume: 12 start-page: 1213 issue: 5 year: 2006 end-page: 1220 article-title: Mesh layouts for block‐based caches publication-title: IEEE Transactions on Visualization and Computer Graphics – volume: 15 start-page: 160 issue: 1 year: 2009 end-page: 173 article-title: Random accessible mesh compression using mesh chartification publication-title: IEEE Transactions on Visualization and Computer Graphics – start-page: 23 year: 2016 end-page: 27 article-title: Triangle reordering for reduced overdraw in animated scenes – start-page: 65 year: 2010 end-page: 73 article-title: On‐the‐fly decompression and rendering of multiresolution terrain – volume: 36 start-page: 71 issue: 5 year: 2017 end-page: 80 article-title: A parallel approach to compression and decompression of triangle meshes using the GPU publication-title: Computer Graphics Forum – volume: 14 start-page: 167 issue: 1 year: 1999 end-page: 186 article-title: Single resolution compression of arbitrary triangular meshes with properties publication-title: Computational Geometry – year: 2022 – start-page: 9 year: 2007 end-page: 16 article-title: Geometry engine optimization: cache friendly compressed representation of geometry – volume: 24 start-page: 469 issue: 3 year: 2005 end-page: 478 article-title: Freelence—coding with free valences publication-title: Computer Graphics Forum – volume: 20 start-page: 53 issue: 1‐2 year: 2001 end-page: 68 article-title: An edgebreaker‐based efficient compression scheme for regular meshes publication-title: Computational Geometry – volume: 31 start-page: 160:1 issue: 6 year: 2012 end-page: 160:9 article-title: Depth‐presorted triangle lists publication-title: ACM Transactions on Graphics – start-page: 886 year: 2005 end-page: 893 article-title: Cache‐oblivious mesh layouts – volume: 13 start-page: 1600 issue: 6 year: 2007 end-page: 1607 article-title: Transform coding for hardware‐accelerated volume rendering publication-title: IEEE Transactions on Visualization and Computer Graphics – volume: 47 start-page: 1 issue: 3 year: 2015 end-page: 41 article-title: 3D mesh compression: Survey, comparisons, and emerging trends publication-title: ACM Computing Surveys – start-page: 197 year: 2000 end-page: 204 article-title: Triangle strip compression – year: 2016 article-title: Optimizing the graphics pipeline with compute – start-page: 115 year: 2005 end-page: 121 article-title: Constrained strip generation and management for efficient interactive 3D rendering – volume: 48 start-page: 181 year: 2022 end-page: 189 article-title: 3D model compression with support of parallel processing on the GPU publication-title: Programming and Computer Software – volume: 5 start-page: 47 year: 1999 end-page: 61 article-title: Edgebreaker: Connectivity compression for triangle meshes publication-title: IEEE Transactions on Visualization and Computer Graphics – year: 2001 article-title: Hierarchical face clustering on polygonal surfaces – volume: 84 start-page: 185 issue: 5 year: 2008 end-page: 195 article-title: Region‐based 3D mesh compression using an efficient neighborhood‐based segmentation publication-title: SIMULATION: Transactions of The Society for Modeling and Simulation International – year: 2007 – year: 2015 article-title: GPU‐driven rendering pipelines – start-page: 26 year: 1998 end-page: 34 – start-page: 293 year: 2003 end-page: 300 article-title: Compression domain volume rendering – start-page: 151 year: 1998 end-page: 158 article-title: The clipmap: A virtual mipmap – year: 2018 article-title: Introduction to turing mesh shaders – start-page: 13 year: 1995 end-page: 20 article-title: Geometry compression – start-page: 141 year: 2002 end-page: 146 article-title: Compressing polygon mesh geometry with parallelogram prediction – volume: 17 start-page: 84 year: 1998 end-page: 115 article-title: Geometric compression through topological surgery publication-title: ACM Transactions on Graphics – volume: 28 start-page: 67 year: 2009 end-page: 83 article-title: Efficient geometry compression for GPU‐based decoding in realtime terrain rendering publication-title: Computer Graphics Forum – start-page: 149 year: 2001 end-page: 158 article-title: Variable‐precision rendering – volume: 23 start-page: 681 issue: 5 year: 1999 end-page: 692 article-title: Hierarchical back‐face computation publication-title: Computers & Graphics – year: 2020 – volume: 45 start-page: 262 issue: 2 year: 2013 end-page: 269 article-title: Zipper: A compact connectivity data structure for triangle meshes publication-title: Computer‐Aided Design – year: 2023 – volume: 3 start-page: 1 issue: 2 year: 2014 end-page: 30 article-title: Survey of efficient representations for independent unit vectors publication-title: Journal of Computer Graphics Techniques (JCGT) – start-page: 133 year: 1998 end-page: 140 article-title: Real time compression of triangle mesh connectivity – volume: 13 start-page: 1536 issue: 6 year: 2007 end-page: 1543 article-title: Random‐accessible compressed triangle meshes publication-title: IEEE Transactions on Visualization and Computer Graphics – start-page: 69 year: 2003 end-page: 75 article-title: Real‐time volume rendering of time‐varying data using a fragment‐shader compression approach – volume: 31 start-page: 2541 issue: 8 year: 2012 end-page: 2553 article-title: Data‐parallel decompression of triangle mesh topology publication-title: Computer Graphics Forum – start-page: 53 year: 2005 end-page: 61 article-title: Hardware‐compatible vertex compression using quantization and simplification – start-page: 347 year: 1997 end-page: 354 article-title: Optimized geometry compression for real‐time rendering – ident: e_1_2_9_24_2 – ident: e_1_2_9_22_2 doi: 10.1145/280814.280836 – ident: e_1_2_9_23_2 doi: 10.1145/364338.364345 – ident: e_1_2_9_6_2 doi: 10.1177/0037549708093374 – ident: e_1_2_9_8_2 – ident: e_1_2_9_7_2 doi: 10.1111/j.1467-8659.2009.01508.x – ident: e_1_2_9_10_2 doi: 10.1145/1230100.1230102 – ident: e_1_2_9_3_2 doi: 10.1016/S0925-7721(99)00026-7 – volume-title: Vision, Modeling, and Visualization year: 2011 ident: e_1_2_9_44_2 – ident: e_1_2_9_49_2 doi: 10.1145/1276377.1276489 – ident: e_1_2_9_56_2 – ident: e_1_2_9_50_2 doi: 10.1109/VISUAL.2003.1250385 – ident: e_1_2_9_55_2 doi: 10.1080/2151237X.2012.641828 – ident: e_1_2_9_26_2 doi: 10.1145/311535.311565 – ident: e_1_2_9_59_2 doi: 10.1109/TVCG.2006.162 – start-page: 26 volume-title: Graphics Interface year: 1998 ident: e_1_2_9_52_2 – ident: e_1_2_9_15_2 doi: 10.1145/218380.218391 – ident: e_1_2_9_54_2 – ident: e_1_2_9_20_2 doi: 10.1145/2010324.1964962 – ident: e_1_2_9_14_2 doi: 10.1109/CGI.2005.1500388 – volume: 3 start-page: 1 issue: 2 year: 2014 ident: e_1_2_9_5_2 article-title: Survey of efficient representations for independent unit vectors publication-title: Journal of Computer Graphics Techniques (JCGT) – ident: e_1_2_9_11_2 doi: 10.1109/TVCG.2008.64 – ident: e_1_2_9_38_2 doi: 10.1145/1730804.1730815 – ident: e_1_2_9_47_2 doi: 10.1109/2945.764870 – ident: e_1_2_9_13_2 doi: 10.1145/2366145.2366179 – ident: e_1_2_9_21_2 – ident: e_1_2_9_29_2 doi: 10.1109/VISUAL.2002.1183768 – ident: e_1_2_9_41_2 doi: 10.1109/TVCG.2006.59 – ident: e_1_2_9_42_2 doi: 10.1111/j.1467-8659.2012.03221.x – ident: e_1_2_9_35_2 – ident: e_1_2_9_53_2 doi: 10.1145/280814.280855 – ident: e_1_2_9_19_2 doi: 10.1016/j.cad.2012.10.009 – ident: e_1_2_9_16_2 doi: 10.1111/j.1467-8659.2008.01298.x – ident: e_1_2_9_57_2 – ident: e_1_2_9_51_2 doi: 10.1145/274363.274365 – ident: e_1_2_9_37_2 doi: 10.1109/TVCG.2017.2695182 – ident: e_1_2_9_18_2 doi: 10.1109/TVCG.2007.70516 – ident: e_1_2_9_32_2 doi: 10.1111/cgf.13246 – volume-title: Vertex decompression in a shader year: 2001 ident: e_1_2_9_4_2 – ident: e_1_2_9_17_2 – ident: e_1_2_9_45_2 doi: 10.1134/S0361768822030082 – ident: e_1_2_9_31_2 – ident: e_1_2_9_43_2 doi: 10.1145/2693443 – ident: e_1_2_9_25_2 – ident: e_1_2_9_33_2 doi: 10.1016/S0097-8493(99)00091-6 – volume-title: Rendering Techniques year: 2007 ident: e_1_2_9_40_2 – ident: e_1_2_9_46_2 doi: 10.1145/1071866.1071876 – ident: e_1_2_9_48_2 doi: 10.1016/S0925-7721(01)00035-9 – ident: e_1_2_9_2_2 doi: 10.1109/PVGS.2003.1249044 – ident: e_1_2_9_12_2 doi: 10.1007/s00371-004-0255-1 – ident: e_1_2_9_61_2 doi: 10.1145/1073204.1073278 – ident: e_1_2_9_36_2 – ident: e_1_2_9_34_2 doi: 10.1111/j.1467-8659.2005.00872.x – ident: e_1_2_9_30_2 doi: 10.1109/VISUAL.2005.1532800 – ident: e_1_2_9_58_2 – ident: e_1_2_9_60_2 doi: 10.1109/TVCG.2007.70585 – ident: e_1_2_9_27_2 doi: 10.1145/2856400.2856408 – ident: e_1_2_9_9_2 doi: 10.1109/VISUAL.1997.663902 – ident: e_1_2_9_28_2 doi: 10.1145/364338.364384 – ident: e_1_2_9_39_2 doi: 10.1145/1015706.1015799 |
| SSID | ssj0004765 |
| Score | 2.4312809 |
| Snippet | In this paper, we study rendering of end‐to‐end compressed triangle meshes using modern GPU techniques, in particular, mesh shaders. Our approach allows us to... |
| SourceID | proquest crossref wiley |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| SubjectTerms | compression algorithms Computer memory Format modeling Random access Rendering Triangles |
| Title | End‐to‐End Compressed Meshlet Rendering |
| URI | https://onlinelibrary.wiley.com/doi/abs/10.1111%2Fcgf.15002 https://www.proquest.com/docview/2931979255 |
| Volume | 43 |
| WOSCitedRecordID | wos001148022600001&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/eLvHCXMwpV1LS8NAEB6k9aAH32K1liAeBImY7GY3wZPUVg9aSrHQW8g-ooKk0lTP_gR_o7_E2U3SVlAQvIQ9TB67OzP7fWH3G4BjTRXRIg3cUFLtUsm0GwmhXZVSjnAjCBKibLEJ3uuFo1HUX4KL6ixMoQ8x--FmIsPmaxPgicgXglw-pGeIZoyQZN3zCDcu7dP-_FAkZ0El7G0kY0pZIbONZ3br98VojjAXcapdaLrr__rEDVgr8aVzWTjEJizpbAtWF1QHt-G0k6nP94_pGC_YdExKsBLiyrnT-SNOpDOwBebQegeG3c59-8Ytaya4khheKULJPEEVpo00YorxxCeEnicSkYIBg1SHRIiAcK2M-qDUKvITz2eBFIIjXCG7UMvGmd4DR8lIMiWDJCFIa4gUimstfUmRUhLK0gacVIMXy1JQ3NS1eI4rYoH9j23_G3A0M30pVDR-MmpWMxCXgZTHiEa8iEdIfPB1dqx_f0Dcvu7axv7fTQ9gxUeYUuzDbkJtOnnVh7As36ZP-aRlPaoF9atBd3j7Bdo6zxs |
| linkProvider | Wiley-Blackwell |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEB6kFdSDb7FadREPgqzYTbIP8CK1a8W2SGmht2XzWBVkK2317E_wN_pLnGR32woKgpclh0mySWYm34TkG4ATRSVRPGG2L6iyqXCVHXCubJlQD-EGYzGRJtmE1-n4g0FwvwCXxVuYjB9ieuCmLcP4a23g-kB6zsrFQ3KOcEYzSZYpqhErQfm6G_Zbs3eRnssKbm_NGpMzC-mbPNPK3_ejGcich6pmrwnX_veX67CaY0zrKlOKDVhQ6SaszDEPbsFZI5Wf7x-TIX6waGm3YGjEpdVW40dcTKtrksyh9Db0w0av3rTzvAm2IDq25L5wa5xKdB1J4ErXix1C6EUsEC1oQEiVTzhnxFNSMxAKJQMnrjkuE5x7CFnIDpTSYap2wZIiEK4ULI4JhjZEcOkpJRxBMawk1E0qcFrMXiRyUnGd2-I5KoILHH9kxl-B46noS8ak8ZNQtViCKDemcYSIpBZ4AQY_2J2Z7N8biOo3oSns_V30CJaavXYrat127vZh2UHYkt3LrkJpMnpVB7Ao3iZP49FhrmBfhtvS-A |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1dS8MwFA1jiuiD3-J0ahEfBKm4Jk1a8EXmqqKOIQp7K81NqoJ0Y5s--xP8jf4Sb9J2m6Ag-FLycJs0H_fmnJKcS8iBZopqmfpuAEy7DLh2Qym1q1ImEG74fkKVTTYh2u2g2w07FXJa3oXJ9SHGP9yMZ9h4bRxc91U65eXwmB4jnDFKkjPMxxhrdJ1ZZ3IrUnC_VPY2mjGFrpA5xzN-9ftuNIGY00DV7jTR0v--cZksFgjTOcuXxAqp6GyVLEzpDq6Ro1amPt8_Rj18YNExQcGKiCvnVg-fcCqdO5tiDq3XyUPUum9eukXWBBeoYZYyAN6QTGHgSEOuuEg8StlJAogVDBxkOqBS-lRoZfQHQavQSxoe90FKgYCFbpBq1sv0JnEUhMAV-ElCkdhQkEpoDR4wJJWU8bRGDsvRi6GQFDeZLV7iklpg_2Pb_xrZH5v2cx2Nn4zq5RTEhSsNY8QjjVCESH2wOTvYv1cQNy8iW9j6u-kemeucR_HNVft6m8x7iFnyQ9l1Uh0NXvUOmYW30fNwsGtX1xeLA9Dh |
| 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=End%E2%80%90to%E2%80%90End+Compressed+Meshlet+Rendering&rft.jtitle=Computer+graphics+forum&rft.au=Mlakar%2C+D&rft.au=Steinberger%2C+M&rft.au=Schmalstieg%2C+D&rft.date=2024-02-01&rft.pub=Blackwell+Publishing+Ltd&rft.issn=0167-7055&rft.eissn=1467-8659&rft.volume=43&rft.issue=1&rft_id=info:doi/10.1111%2Fcgf.15002&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 |