Survey of Inter‐Prediction Methods for Time‐Varying Mesh Compression

Time‐varying meshes (TVMs), that is mesh sequences with varying connectivity, are a greatly versatile representation of shapes evolving in time, as they allow a surface topology to change or details to appear or disappear at any time during the sequence. This, however, comes at the cost of large sto...

Full description

Saved in:

Bibliographic Details
Published in:	Computer graphics forum Vol. 44; no. 1
Main Authors:	Dvořák, Jan, Hácha, Filip, Arvanitis, Gerasimos, Podgorelec, David, Moustakas, Konstantinos, Váša, Libor
Format:	Journal Article
Language:	English
Published:	Oxford Blackwell Publishing Ltd 01.02.2025
Subjects:	compression algorithms data compression modelling polygonal mesh reduction Topology
ISSN:	0167-7055, 1467-8659
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	Time‐varying meshes (TVMs), that is mesh sequences with varying connectivity, are a greatly versatile representation of shapes evolving in time, as they allow a surface topology to change or details to appear or disappear at any time during the sequence. This, however, comes at the cost of large storage size. Since 2003, there have been attempts to compress such data efficiently. While the problem may seem trivial at first sight, considering the strong temporal coherence of shapes represented by the individual frames, it turns out that the varying connectivity and the absence of implicit correspondence information that stems from it makes it rather difficult to exploit the redundancies present in the data. Therefore, efficient and general TVM compression is still considered an open problem. We describe and categorize existing approaches while pointing out the current challenges in the field and hint at some related techniques that might be helpful in addressing them. We also provide an overview of the reported performance of the discussed methods and a list of datasets that are publicly available for experiments. Finally, we also discuss potential future trends in the field. This paper surveys existing methods for compressing time‐varying meshes (TVMs), focusing on the challenge of exploiting data redundancies due to varying connectivity and the absence of implicit correspondence information. We review current performance, available datasets, and potential future trends in the field.
AbstractList	Time‐varying meshes (TVMs), that is mesh sequences with varying connectivity, are a greatly versatile representation of shapes evolving in time, as they allow a surface topology to change or details to appear or disappear at any time during the sequence. This, however, comes at the cost of large storage size. Since 2003, there have been attempts to compress such data efficiently. While the problem may seem trivial at first sight, considering the strong temporal coherence of shapes represented by the individual frames, it turns out that the varying connectivity and the absence of implicit correspondence information that stems from it makes it rather difficult to exploit the redundancies present in the data. Therefore, efficient and general TVM compression is still considered an open problem. We describe and categorize existing approaches while pointing out the current challenges in the field and hint at some related techniques that might be helpful in addressing them. We also provide an overview of the reported performance of the discussed methods and a list of datasets that are publicly available for experiments. Finally, we also discuss potential future trends in the field. This paper surveys existing methods for compressing time‐varying meshes (TVMs), focusing on the challenge of exploiting data redundancies due to varying connectivity and the absence of implicit correspondence information. We review current performance, available datasets, and potential future trends in the field. Time‐varying meshes (TVMs), that is mesh sequences with varying connectivity, are a greatly versatile representation of shapes evolving in time, as they allow a surface topology to change or details to appear or disappear at any time during the sequence. This, however, comes at the cost of large storage size. Since 2003, there have been attempts to compress such data efficiently. While the problem may seem trivial at first sight, considering the strong temporal coherence of shapes represented by the individual frames, it turns out that the varying connectivity and the absence of implicit correspondence information that stems from it makes it rather difficult to exploit the redundancies present in the data. Therefore, efficient and general TVM compression is still considered an open problem. We describe and categorize existing approaches while pointing out the current challenges in the field and hint at some related techniques that might be helpful in addressing them. We also provide an overview of the reported performance of the discussed methods and a list of datasets that are publicly available for experiments. Finally, we also discuss potential future trends in the field. Time‐varying meshes (TVMs), that is mesh sequences with varying connectivity, are a greatly versatile representation of shapes evolving in time, as they allow a surface topology to change or details to appear or disappear at any time during the sequence. This, however, comes at the cost of large storage size. Since 2003, there have been attempts to compress such data efficiently. While the problem may seem trivial at first sight, considering the strong temporal coherence of shapes represented by the individual frames, it turns out that the varying connectivity and the absence of implicit correspondence information that stems from it makes it rather difficult to exploit the redundancies present in the data. Therefore, efficient and general TVM compression is still considered an open problem. We describe and categorize existing approaches while pointing out the current challenges in the field and hint at some related techniques that might be helpful in addressing them. We also provide an overview of the reported performance of the discussed methods and a list of datasets that are publicly available for experiments. Finally, we also discuss potential future trends in the field.
Author	Moustakas, Konstantinos Dvořák, Jan Arvanitis, Gerasimos Podgorelec, David Váša, Libor Hácha, Filip
Author_xml	– sequence: 1 givenname: Jan orcidid: 0000-0003-4569-1151 surname: Dvořák fullname: Dvořák, Jan email: jdvorak@kiv.zcu.cz organization: University of West Bohemia in Pilsen, Faculty of Applied Sciences – sequence: 2 givenname: Filip orcidid: 0000-0001-8956-6411 surname: Hácha fullname: Hácha, Filip email: hachaf@kiv.zcu.cz organization: University of West Bohemia in Pilsen, Faculty of Applied Sciences – sequence: 3 givenname: Gerasimos orcidid: 0000-0001-8149-5188 surname: Arvanitis fullname: Arvanitis, Gerasimos email: arvanitis@ece.upatras.gr organization: University of Patras – sequence: 4 givenname: David orcidid: 0000-0002-0701-9201 surname: Podgorelec fullname: Podgorelec, David email: david.podgorelec@um.si organization: University of Maribor – sequence: 5 givenname: Konstantinos orcidid: 0000-0001-7617-227X surname: Moustakas fullname: Moustakas, Konstantinos email: moustakas@upatras.gr organization: University of Patras – sequence: 6 givenname: Libor orcidid: 0000-0002-0213-3769 surname: Váša fullname: Váša, Libor email: lvasa@kiv.zcu.cz organization: University of West Bohemia in Pilsen, Faculty of Applied Sciences
BookMark	eNp1kEtOwzAQhi1UJEphwQ0isWKR1nbi1xJF9CEVgURha6XOuE3VxsVOQd1xBM7ISTCELbOYGWm-mfn1n6Ne4xpA6IrgIYkxMis7JIwKeYL6JOcilZypHupjEnuBGTtD5yFsMMa54KyPpk8H_wbHxNlk1rTgvz4-Hz1UtWlr1yT30K5dFRLrfLKodxCnL6U_1s0qjsI6Kdxu7yGEyF6gU1tuA1z-1QF6Ht8timk6f5jMitt5aqiiMjU5XyqbS2kUzagUWEkmltRmhjBmrcWMKiiXxmJciQgSbqCMSqHiHBOcZwN03d3de_d6gNDqjTv4Jr7UGRFE5jGpSN10lPEuBA9W7329i9I1wfrHKB2N0r9GRXbUse_1Fo7_g7qYjLuNb5rWbIs
Cites_doi	10.1145/1399504.1360696 10.1109/tcsvt.2003.817625 10.1145/1661412.1618520 10.1002/cav.319 10.22630/MGV.2014.23.1.4 10.1109/tvcg.2012.308 10.1145/1186822.1073237 10.1109/VCIP59821.2023.10402678 10.1109/ICMEW53276.2021.9456018 10.1016/B978-0-32-391755-1.00024-9 10.1109/TASE.2009.2021336 10.1109/tcsvt.2011.2158337 10.1109/tcsvt.2002.806814 10.1145/566654.566591 10.1145/2072298.2072349 10.1109/ICASSP.2014.6854785 10.1109/3DTV.2010.5506299 10.1111/j.1467‐8659.2007.01026.x 10.1016/j.cviu.2004.03.012 10.1109/VCIP59821.2023.10402693 10.1109/2945.764870 10.1109/CVPR.2017.591 10.1111/cgf.12001 10.1145/37401.37422 10.1016/j.cag.2021.10.015 10.1145/2693443 10.1145/1275808.1276478 10.1111/cgf.13491 10.1109/ICIP.2008.4711937 10.1109/CVPR52729.2023.01632 10.1109/ojsp.2022.3160392 10.1145/2816795.2818013 10.1109/ICASSP48485.2024.10447762 10.1145/3329714.3338130 10.1007/978-3-030-77977-1_4 10.1016/j.cviu.2023.103836 10.1007/978-3-642-37331-2_37 10.1109/tmm.2021.3119872 10.1109/TCSVT.2012.2221191 10.1109/ICCVW60793.2023.00239 10.1007/s41233‐023‐00057‐4 10.2174/157489281703220520103556 10.1016/j.jvcir.2024.104110 10.1109/CVPR52688.2022.00651 10.1109/tcsvt.2020.2985911 10.1109/CVPR46437.2021.00150 10.1145/2407516.2407540 10.1109/VCIP59821.2023.10402714 10.1111/cgf.14719 10.1109/tcsvt.2014.2313890 10.5909/jbe.2024.29.1.42 10.1109/MMSP48831.2020.9287057 10.1145/2185520.2185549 10.1109/TIP.2016.2529506 10.1109/EUVIP53989.2022.9922839 10.1007/978-3-031-36027-5_9 10.1109/ICTC55196.2022.9952734 10.1145/1873951.1874010 10.1109/PCS56426.2022.10018051 10.1109/3DTV.2010.5506509 10.1109/jetcas.2018.2885981 10.1109/TCSVT.2016.2543039 10.1109/EUVIP53989.2022.9922894 10.1109/ICRA.2012.6224647 10.1109/ISCAS46773.2023.10182003 10.1109/ICASSP.2014.6854788 10.1145/566570.566589 10.1109/ISCAS.2014.6865596 10.1109/VCIP59821.2023.10402731 10.1145/3132705 10.1109/lsp.2021.3102525 10.1109/ICIP.2017.8296514 10.1145/3592786 10.1109/tcom.1981.1094950 10.1109/ICIP49359.2023.10222117 10.1109/EUVIP53989.2022.9922888 10.5594/jmi.2021.3067962 10.1007/978-3-030-58539-6_36 10.1109/access.2022.3197295 10.1109/ICIP.2010.5652911 10.1109/MMSP48831.2020.9287165 10.1117/12.571117 10.1111/j.1467‐8659.2006.00990.x 10.1049/el:20010993 10.1561/2400000003 10.1109/ACCESS.2020.2991478 10.1109/CVPR42600.2020.00650 10.1109/tpami.2011.258 10.1017/ATSIP.2019.24 10.1109/CVPR.2007.383294 10.1016/j.cad.2013.08.018 10.1007/3DRes.01(2012)2 10.1145/3072959.3073711 10.1109/ICIP42928.2021.9506298 10.1145/300523.300533 10.1109/ICIP40778.2020.9190648 10.1142/s0218654305000748 10.1109/TVCG.2010.38 10.1109/ICMEW59549.2023.00029 10.1155/2009/609350 10.1109/TVCG.2013.22 10.1109/3DTV.2008.4547817 10.1109/tcsvt.2013.2248971 10.1145/1618452.1618521 10.1109/EUVIP53989.2022.9922890 10.1007/978-3-540-70517-8_12 10.1109/ICCV.2019.00548 10.1145/1028523.1028547 10.1109/TIP.2019.2931621 10.1145/2984511.2984517 10.1145/258734.258849 10.1145/274363.274365 10.3390/electronics12163473 10.1109/VCIP.2013.6706442 10.1109/ICIP49359.2023.10222073 10.1016/j.cag.2012.06.004 10.1109/tcsvt.2014.2329376 10.1109/tcsvt.2007.903810 10.1111/1467‐8659.00433 10.1145/2407746.2407768 10.1109/TMM.2012.2229264 10.1109/TCSVT.2014.2319631 10.1109/ICIP46576.2022.9897391 10.1109/ICME.2019.00160 10.1109/CVPR.2019.00459 10.1109/34.121791 10.1109/TIP.2006.877413 10.1111/j.1467‐8659.2012.03176.x
ContentType	Journal Article
Copyright	2025 The Author(s). published by Eurographics ‐ The European Association for Computer Graphics and John Wiley & Sons Ltd. 2025. This work is published under Creative Commons Attribution License~https://creativecommons.org/licenses/by/3.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: 2025 The Author(s). published by Eurographics ‐ The European Association for Computer Graphics and John Wiley & Sons Ltd. – notice: 2025. This work is published under Creative Commons Attribution License~https://creativecommons.org/licenses/by/3.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.15278
DatabaseName	Wiley 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_15278 CGF15278
Genre	researchArticle
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 AAHHS AAHQN AAMNL AANHP AANLZ AAONW AASGY AAXRX AAYCA AAZKR ABCQN ABCUV ABDBF ABDPE ABEML ABPVW ACAHQ ACBWZ ACCFJ ACCZN ACFBH ACGFS ACPOU ACRPL ACSCC ACUHS ACXBN ACXQS ACYXJ ADBBV ADEOM ADIZJ ADKYN ADMGS ADMLS ADNMO ADOZA ADXAS ADZMN ADZOD AEEZP AEGXH AEIGN AEIMD AEMOZ AENEX AEQDE AEUQT AEUYR AFBPY AFEBI AFFNX AFFPM AFGKR AFPWT AFWVQ AFZJQ AHBTC AHEFC AHQJS AITYG AIURR AIWBW AJBDE 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 WRC WXSBR WYISQ WZISG XG1 ZL0 ZZTAW ~IA ~IF ~WT AAMMB AAYXX AEFGJ AEYWJ AGHNM AGQPQ AGXDD AGYGG AIDQK AIDYY AIQQE CITATION O8X 7SC 8FD JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c2928-c46b9f488c92328709857b2f3c155fff0529eabcf00d79f416cea765ed6601043
IEDL.DBID	24P
ISICitedReferencesCount	0
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001395321000001&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	Sat Aug 23 12:53:55 EDT 2025 Sat Nov 29 07:52:04 EST 2025 Fri Feb 28 09:44:43 EST 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	1
Language	English
License	Attribution
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c2928-c46b9f488c92328709857b2f3c155fff0529eabcf00d79f416cea765ed6601043
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0001-8956-6411 0000-0002-0213-3769 0000-0002-0701-9201 0000-0003-4569-1151 0000-0001-7617-227X 0000-0001-8149-5188
OpenAccessLink	https://onlinelibrary.wiley.com/doi/abs/10.1111%2Fcgf.15278
PQID	3171841719
PQPubID	30877
PageCount	30
ParticipantIDs	proquest_journals_3171841719 crossref_primary_10_1111_cgf_15278 wiley_primary_10_1111_cgf_15278_CGF15278
PublicationCentury	2000
PublicationDate	February 2025
PublicationDateYYYYMMDD	2025-02-01
PublicationDate_xml	– month: 02 year: 2025 text: February 2025
PublicationDecade	2020
PublicationPlace	Oxford
PublicationPlace_xml	– name: Oxford
PublicationTitle	Computer graphics forum
PublicationYear	2025
Publisher	Blackwell Publishing Ltd
Publisher_xml	– name: Blackwell Publishing Ltd
References	2015; 34 2013; 23 2023; 8 2002; 12 2021; 28 2003; 13 2022; 24 2014; 24 2024; 100 1992; 14 2024 2011; 17 2014; 23 2013; 19 2020; 8 2014; 1 2009; 2009 2015; 47 1998; 17 2013; 15 2000; 19 2021; 31 2001 2017; 37 2017; 36 2006; 25 1987 2012; 22 2024; 29 2018; 37 2007; 26 2007; 17 2019; 8 2019; 9 2023; 12 2009; 20 2012 2011 2010 2006; 15 1998 2009 1997 2008 2007 2006 2014; 46 1981; 29 2005 2022; 42 2004 2003 2002 2012; 36 2012; 34 1999; 5 2012; 31 2009; 28 1999 2023; 42 2004; 96 2015; 25 2012; 3 2023 2022; 3 2022 2013; 32 2021 2020 2002; 21 2023; 237 2019 2018 2017 2001; 37 2009; 6 2021; 130 2014 2022; 10 2013 2016; 27 2016; 25 2005; 11 2022; 102 2020; 29 e_1_2_14_137_2 e_1_2_14_73_2 e_1_2_14_96_2 e_1_2_14_110_2 e_1_2_14_50_2 e_1_2_14_92_2 e_1_2_14_12_2 e_1_2_14_31_2 e_1_2_14_54_2 e_1_2_14_16_2 e_1_2_14_35_2 e_1_2_14_58_2 e_1_2_14_77_2 e_1_2_14_28_2 cr-split#-e_1_2_14_11_2.1 e_1_2_14_140_2 e_1_2_14_6_2 cr-split#-e_1_2_14_11_2.2 e_1_2_14_107_2 e_1_2_14_121_2 e_1_2_14_144_2 e_1_2_14_103_2 e_1_2_14_125_2 e_1_2_14_148_2 e_1_2_14_85_2 e_1_2_14_129_2 e_1_2_14_62_2 e_1_2_14_2_2 e_1_2_14_81_2 e_1_2_14_66_2 e_1_2_14_20_2 e_1_2_14_43_2 e_1_2_14_24_2 e_1_2_14_47_2 e_1_2_14_89_2 e_1_2_14_17_2 e_1_2_14_151_2 e_1_2_14_119_2 e_1_2_14_132_2 e_1_2_14_155_2 e_1_2_14_115_2 e_1_2_14_136_2 e_1_2_14_159_2 e_1_2_14_72_2 e_1_2_14_111_2 e_1_2_14_95_2 e_1_2_14_30_2 e_1_2_14_91_2 e_1_2_14_34_2 e_1_2_14_53_2 e_1_2_14_38_2 e_1_2_14_76_2 e_1_2_14_15_2 e_1_2_14_57_2 e_1_2_14_99_2 Valenzise G. (e_1_2_14_138_2) 2023 e_1_2_14_7_2 e_1_2_14_108_2 e_1_2_14_120_2 e_1_2_14_143_2 e_1_2_14_104_2 e_1_2_14_124_2 e_1_2_14_147_2 e_1_2_14_84_2 e_1_2_14_100_2 e_1_2_14_128_2 e_1_2_14_3_2 e_1_2_14_61_2 e_1_2_14_80_2 e_1_2_14_23_2 e_1_2_14_42_2 e_1_2_14_65_2 e_1_2_14_27_2 e_1_2_14_46_2 e_1_2_14_69_2 e_1_2_14_88_2 e_1_2_14_39_2 e_1_2_14_150_2 e_1_2_14_131_2 e_1_2_14_116_2 e_1_2_14_154_2 e_1_2_14_135_2 e_1_2_14_71_2 e_1_2_14_94_2 e_1_2_14_112_2 e_1_2_14_158_2 e_1_2_14_139_2 e_1_2_14_52_2 e_1_2_14_90_2 e_1_2_14_10_2 e_1_2_14_33_2 e_1_2_14_56_2 e_1_2_14_79_2 e_1_2_14_14_2 e_1_2_14_37_2 e_1_2_14_75_2 e_1_2_14_98_2 Sorkine O. (e_1_2_14_118_2) 2007 e_1_2_14_4_2 e_1_2_14_109_2 e_1_2_14_142_2 e_1_2_14_8_2 e_1_2_14_105_2 e_1_2_14_123_2 e_1_2_14_146_2 e_1_2_14_83_2 e_1_2_14_101_2 e_1_2_14_127_2 e_1_2_14_41_2 e_1_2_14_60_2 e_1_2_14_22_2 e_1_2_14_45_2 e_1_2_14_64_2 e_1_2_14_26_2 e_1_2_14_49_2 e_1_2_14_87_2 e_1_2_14_68_2 e_1_2_14_19_2 e_1_2_14_130_2 e_1_2_14_153_2 e_1_2_14_117_2 e_1_2_14_134_2 e_1_2_14_157_2 e_1_2_14_113_2 e_1_2_14_93_2 e_1_2_14_74_2 e_1_2_14_51_2 e_1_2_14_70_2 e_1_2_14_55_2 e_1_2_14_32_2 e_1_2_14_13_2 e_1_2_14_59_2 e_1_2_14_97_2 e_1_2_14_36_2 e_1_2_14_78_2 e_1_2_14_29_2 e_1_2_14_160_2 e_1_2_14_5_2 e_1_2_14_141_2 e_1_2_14_9_2 e_1_2_14_106_2 e_1_2_14_122_2 e_1_2_14_145_2 e_1_2_14_82_2 e_1_2_14_102_2 e_1_2_14_126_2 e_1_2_14_149_2 e_1_2_14_40_2 e_1_2_14_63_2 e_1_2_14_44_2 e_1_2_14_67_2 e_1_2_14_21_2 e_1_2_14_86_2 e_1_2_14_48_2 e_1_2_14_25_2 e_1_2_14_18_2 e_1_2_14_152_2 e_1_2_14_133_2 e_1_2_14_114_2 e_1_2_14_156_2
References_xml	– volume: 42 start-page: 60 issue: 1 year: 2022 end-page: 71 article-title: Priority‐based encoding of triangle mesh connectivity for a known geometry publication-title: Computer Graphics Forum – start-page: 3133 year: 2021 end-page: 3137 article-title: Video‐based dynamic mesh coding – year: 2023 article-title: Inter‐frame coding for dynamic meshes via temporally‐consistent re‐meshing – volume: 31 start-page: 765 issue: 2 year: 2021 end-page: 781 article-title: View‐Dependent Dynamic Point Cloud Compression publication-title: IEEE Transactions on Circuits and Systems for Video Technology – year: 2022 article-title: Compression of time‐varying textured meshes using patch tiling and image‐based tracking – volume: 8 start-page: 4 issue: 1 year: 2023 article-title: Crafting the MPEG metrics for objective and perceptual quality assessment of volumetric videos publication-title: Quality and User Experience – year: 2023 article-title: Texture coordinate prediction using structural information for MPEG V‐DMC – volume: 24 start-page: 4504 year: 2022 end-page: 4513 article-title: Motion estimation and coding structure for inter‐prediction of lidar point cloud geometry publication-title: IEEE Transactions on Multimedia – year: 2023 article-title: Improving the compression efficiency of displacement using morton‐ordered micro‐image in video‐based dynamic mesh coding – volume: 130 start-page: 36 issue: 4 year: 2021 end-page: 52 article-title: V‐pcc performance evaluation of the first MPEG point codec publication-title: SMPTE Motion Imaging Journal – year: 2022 article-title: Graph filter‐based fast motion matching for inter frame coding of MPEG G‐PCC – year: 2019 article-title: Data‐adaptive packing method for compression of dynamic point cloud sequences – start-page: 355 year: 2002 end-page: 361 article-title: Geometry images – volume: 31 issue: 4 year: 2012 article-title: Tracking surfaces with evolving topology publication-title: ACM Transactions on Graphics – volume: 25 start-page: 685 issue: 4 year: 2006 end-page: 695 article-title: GEncode: Geometry‐driven compression for general meshes publication-title: Computer Graphics Forum – volume: 34 start-page: 248:1 issue: 6 year: 2015 end-page: 248:16 article-title: SMPL: A skinned multi‐person linear model publication-title: ACM Transactions on Graphics (Proc. SIGGRAPH Asia) – start-page: 609 year: 2005 end-page: 616 – start-page: 112 year: 2008 end-page: 121 – volume: 237 year: 2023 article-title: 4DHumanOutfit: A multi‐subject 4D dataset of human motion sequences in varying outfits exhibiting large displacements publication-title: Computer Vision and Image Understanding – start-page: 45 year: 2021 end-page: 58 – volume: 1 start-page: 127 issue: 3 year: 2014 end-page: 239 article-title: Proximal algorithms publication-title: Foundations and trends® in Optimization – start-page: 146 year: 2003 end-page: 155 article-title: Multi‐chart geometry images – year: 2023 article-title: Arithmetic coding of displacements in dynamic meshes with bypass mode for complexity reduction – year: 2019 article-title: Occupancy flow: 4D reconstruction by learning particle dynamics – year: 2008 – year: 2022 – volume: 23 start-page: 59 issue: 1/2 year: 2014 end-page: 82 article-title: A curvature‐tensor‐based perceptual quality metric for 3D triangular meshes publication-title: Machine Graphics & Vision – volume: 22 start-page: 1649 issue: 12 year: 2012 end-page: 1668 article-title: Overview of the high efficiency video coding (HEVC) standard publication-title: IEEE Transactions on Circuits and Systems for Video Technology – 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 – year: 2022 article-title: Formal visual evaluation and study of objective metrics for MPEG dynamic mesh coding – year: 2011 article-title: Modeling 3D articulated motions with conformal geometry videos (CGVS) – volume: 37 start-page: 1445 issue: 24 year: 2001 article-title: Motion‐compensated compression of 3D animation models publication-title: Electronics Letters – year: 2023 article-title: Scalable video‐based dynamic mesh coding – start-page: 598 year: 2020 end-page: 613 article-title: Star: Sparse trained articulated human body regressor – volume: 2009 start-page: 1 year: 2009 end-page: 9 article-title: A dense point‐to‐point alignment method for realistic 3D face morphing and animation publication-title: International Journal of Computer Games Technology – volume: 25 start-page: 51 issue: 1 year: 2015 end-page: 62 article-title: Compressing 3‐D human motions via keyframe‐based geometry videos publication-title: IEEE Transactions on Circuits and Systems for Video Technology – year: 2023 article-title: Hierarchical arithmetic coding of displacements for dynamic mesh compression – start-page: 225 year: 2022 end-page: 228 article-title: MPEG Dynamic Mesh Coding (DMC) standardization trend for volumetric video – volume: 28 start-page: 1660 year: 2021 end-page: 1664 article-title: Silhouette 4D with context selection: Lossless geometry compression of dynamic point clouds publication-title: IEEE Signal Processing Letters – volume: 8 issue: 1 year: 2019 article-title: Video coding of dynamic 3D point cloud data publication-title: APSIPA Transactions on Signal and Information Processing – volume: 42 issue: 3 year: 2023 article-title: Textured mesh quality assessment: Large‐scale dataset and deep learning‐based quality metric publication-title: ACM Transactions on Graphics – volume: 12 start-page: 1178 issue: 12 year: 2002 end-page: 1184 article-title: Compression of 3‐D triangle mesh sequences based on vertex‐wise motion vector prediction publication-title: IEEE Transactions on Circuits and Systems for Video Technology – volume: 36 issue: 4 year: 2017 article-title: Clothcap: Seamless 4D clothing capture and retargeting publication-title: ACM Transactions on Graphics (Proc. SIGGRAPH) – year: 2007 – start-page: 80 year: 2007 end-page: es – volume: 37 start-page: 61 issue: 5 year: 2018 end-page: 70 article-title: Error propagation control in laplacian mesh compression publication-title: Computer Graphics Forum – year: 2020 article-title: Muscle: Multi sweep compression of lidar using deep entropy models – volume: 21 start-page: 372 issue: 3 year: 2002 end-page: 379 article-title: Progressive lossless compression of arbitrary simplicial complexes publication-title: ACM Transactions on Graphics – year: 2022 article-title: Video and subdivision based mesh coding – year: 2021 article-title: Volograms & V‐SENSE Volumetric Video Dataset – volume: 3 start-page: 155 year: 2022 end-page: 168 article-title: Patch re‐segmentation and packing for dynamic point cloud compression via back‐and‐forth structure publication-title: IEEE Open Journal of Signal Processing – year: 2014 article-title: On human time‐varying mesh compression exploiting activity‐related characteristics – start-page: 209 year: 1997 end-page: 216 article-title: Surface simplification using quadric error metrics – year: 2024 article-title: Embedded graph representation for inter‐frame coding of dynamic meshes – year: 2012 article-title: Online point‐cloud transmission for tele‐immersion – start-page: 6614 year: 2022 end-page: 6624 article-title: CaDeX: Learning canonical deformation coordinate space for dynamic surface representation via neural homeomorphism – volume: 19 start-page: 1467 issue: 09 year: 2013 end-page: 1475 article-title: Exploiting connectivity to improve the tangential part of geometry prediction publication-title: IEEE Transactions on Visualization and Computer Graphics – volume: 29 start-page: 1799 issue: 12 year: 1981 end-page: 1808 article-title: Displacement measurement and its application in interframe image coding publication-title: IEEE Transactions on Communications – year: 2020 article-title: Learning to dress 3D people in generative clothing – volume: 15 start-page: 2531 issue: 9 year: 2006 end-page: 2544 article-title: Semi‐regular representation and progressive compression of 3‐D dynamic mesh sequences publication-title: IEEE Transactions on Image Processing – year: 2021 article-title: Neural deformation graphs for globally‐consistent non‐rigid reconstruction – start-page: 4455 year: 2019 end-page: 4465 article-title: Occupancy networks: Learning 3D reconstruction in function space – volume: 37 start-page: 1 issue: 1 year: 2017 end-page: 14 article-title: Boundary first flattening publication-title: ACM Transactions on Graphics – volume: 34 start-page: 1645 issue: 8 year: 2012 end-page: 1657 article-title: Topology dictionary for 3D video understanding publication-title: IEEE Transactions on Pattern Analysis and Machine Intelligence – volume: 3 start-page: 2 issue: 1 year: 2012 article-title: Efficient rate‐distortion compression of dynamic point cloud for grid‐pattern‐based 3D scanning systems publication-title: 3D Research – start-page: 501 year: 2023 end-page: 552 – volume: 32 start-page: 101 issue: 1 year: 2013 end-page: 125 article-title: Perceptual metrics for static and dynamic triangle meshes publication-title: Computer Graphics Forum – volume: 9 start-page: 133 issue: 1 year: 2019 end-page: 148 article-title: Emerging MPEG standards for point cloud compression publication-title: IEEE Journal on Emerging and Selected Topics in Circuits and Systems – year: 2013 article-title: Expression‐invariant and sparse representation for mesh‐based compression for 3‐D face models – year: 2008 article-title: The new MPEG‐4/FAMC standard for animated 3D mesh compression – year: 2023 article-title: Hi4D: 4D instance segmentation of close human interaction – year: 2013 – volume: 96 start-page: 393 issue: 3 year: 2004 end-page: 434 article-title: Real‐time 3D shape reconstruction, dynamic 3D mesh deformation, and high fidelity visualization for 3D video publication-title: Computer Vision and Image Understanding – year: 2023 article-title: An efficient video‐based geometry compression system for 3D meshes – year: 2007 article-title: Topology matching for 3D video compression – year: 2009 – year: 2017 article-title: Dynamic FAUST: Registering human bodies in motion – volume: 8 start-page: 83538 year: 2020 end-page: 83547 article-title: 3D motion estimation and compensation method for video‐based point cloud compression publication-title: IEEE Access – year: 2022 article-title: Overview of the video‐based dynamic mesh coding (V‐DMC) standard work – volume: 24 start-page: 2099 issue: 12 year: 2014 end-page: 2116 article-title: Toward real‐time and efficient compression of human time‐varying meshes publication-title: IEEE Transactions on Circuits and Systems for Video Technology – start-page: 1 year: 2020 end-page: 5 article-title: Mesh coding extensions to MPEG‐I V‐PCC – start-page: 3433 year: 2010 end-page: 3436 article-title: Patch‐based compression for time‐varying meshes – start-page: 136 end-page: 146 article-title: Geometry videos: A new representation for 3D animations – year: 2022 article-title: Boundary‐preserved geometry video for dynamic mesh coding – volume: 27 start-page: 828 issue: 4 year: 2016 end-page: 842 article-title: Design, implementation, and evaluation of a point cloud codec for tele‐immersive video publication-title: IEEE Transactions on Circuits and Systems for Video Technology – year: 2023 article-title: Embedded deformation‐based compression for human 3D dynamic meshes with changing topology – volume: 24 start-page: 1541 issue: 9 year: 2014 end-page: 1553 article-title: A highly efficient compression framework for time‐varying 3‐D facial expressions publication-title: IEEE Transactions on Circuits and Systems for Video Technology – year: 2021 – year: 2023 article-title: 1D displacement coding for the displaced subdivision surface – year: 2024 – volume: 102 start-page: 329 year: 2022 end-page: 338 article-title: As‐rigid‐as‐possible volume tracking for time‐varying surfaces publication-title: Computers & Graphics – volume: 29 start-page: 289 year: 2020 end-page: 302 article-title: Advanced 3D motion prediction for video‐based dynamic point cloud compression publication-title: IEEE Transactions on Image Processing – volume: 46 start-page: 58 year: 2014 end-page: 68 article-title: Optimizing polycube domain construction for hexahedral remeshing publication-title: Computer‐Aided Design – volume: 19 start-page: 411 issue: 3 year: 2000 end-page: 418 article-title: Representing animations by principal components publication-title: Computer Graphics Forum – year: 2012 article-title: Dynamic 3‐D facial compression using low rank and sparse decomposition – volume: 100 year: 2024 article-title: Occupancy map‐based low complexity motion prediction for video‐based point cloud compression publication-title: Journal of Visual Communication and Image Representation – year: 2018 – start-page: 26 year: 1998 end-page: 34 article-title: Triangle mesh compression – volume: 19 start-page: 1158 issue: 7 year: 2013 end-page: 1171 article-title: Interactive applications for sketch‐based editable polycube map publication-title: IEEE Transactions on Visualization and Computer Graphics – volume: 5 start-page: 47 issue: 1 year: 1999 end-page: 61 article-title: Edgebreaker: Connectivity compression for triangle meshes publication-title: IEEE Transactions on Visualization and Computer Graphics – start-page: 2161 year: 2014 end-page: 2164 article-title: A novel compression framework for 3D time‐varying meshes – start-page: 89 year: 1999 end-page: 95 article-title: Compression of time‐dependent geometry – year: 2010 article-title: Modeling 3D facial expressions using geometry videos – start-page: 1045 year: 2008 end-page: 1048 article-title: Geometry compression for time‐varying meshes using coarse and fine levels of quantization and run‐length encoding – year: 1987 article-title: Marching cubes: A high resolution 3D surface construction algorithm – year: 2004 – volume: 17 start-page: 220 issue: 2 year: 2011 end-page: 230 article-title: A perception correlated comparison method for dynamic meshes publication-title: IEEE Transactions on Visualization and Computer Graphics – volume: 10 start-page: 83678 year: 2022 end-page: 83691 article-title: Lossless compression of point cloud sequences using sequence optimized CNN models publication-title: IEEE Access – volume: 15 start-page: 339 issue: 2 year: 2013 end-page: 358 article-title: Real‐time, full 3‐D reconstruction of moving foreground objects from multiple consumer depth cameras publication-title: IEEE Transactions on Multimedia – start-page: 113 year: 2023 end-page: 127 – start-page: 1 year: 2010 end-page: 4 article-title: Deformation‐based data reduction of time‐varying meshes for displaying on mobile terminals – start-page: 741 end-page: 754 article-title: Holoportation: Virtual 3D teleportation in real‐time – start-page: 2691 year: 2020 end-page: 2695 article-title: Silhouette 4d: An inter‐frame lossless geometry coder of dynamic voxelized point clouds – year: 2010 article-title: Mixed spatial and SNR scalability for TVM geometry coding – volume: 22 start-page: 77 issue: 1 year: 2012 end-page: 90 article-title: Modeling and compressing 3D facial expressions using geometry videos publication-title: IEEE Transactions on Circuits and Systems for Video Technology – volume: 29 start-page: 42 issue: 1 year: 2024 end-page: 56 article-title: Valence based lifting wavelet transform for video‐based dynamic mesh compression publication-title: Journal of Broadcast Engineering – volume: 13 start-page: 1144 issue: 11 year: 2003 end-page: 1155 article-title: Registration and partitioning‐based compression of 3‐D dynamic data publication-title: IEEE Transactions on Circuits and Systems for Video Technology – year: 2021 article-title: An improved coarse‐to‐fine motion estimation scheme for lidar point cloud geometry compression – start-page: 486 year: 2013 end-page: 499 – volume: 26 start-page: 813 issue: 4 year: 2007 end-page: 823 article-title: Distance‐ranked connectivity compression of triangle meshes publication-title: Computer Graphics Forum – volume: 12 start-page: 3473 issue: 16 year: 2023 article-title: A method for generating geometric image sequences for non‐isomorphic 3D‐mesh sequence compression publication-title: Electronics – start-page: 301 year: 2004 end-page: 306 article-title: Skin‐off: Representation and compression scheme for 3D video – volume: 17 start-page: 1506 issue: 11 year: 2007 end-page: 1518 article-title: Time‐varying mesh compression using an extended block matching algorithm publication-title: IEEE Transactions on Circuits and Systems for Video Technology – start-page: 1412 year: 2017 end-page: 1416 article-title: Context‐based octree coding for point‐cloud video – year: 2001 article-title: Calculation of average PSNR differences between RD‐curves – volume: 31 start-page: 1715 issue: 5 year: 2012 end-page: 1724 article-title: Dihedral angle mesh error: A fast perception correlated distortion measure for fixed connectivity triangle meshes publication-title: Computer Graphics Forum – year: 2012 – volume: 28 start-page: 1 issue: 5 year: 2009 end-page: 10 article-title: Robust single‐view geometry and motion reconstruction publication-title: ACM Transactions on Graphics – start-page: 1 year: 2020 end-page: 6 article-title: Skeleton‐based motion estimation for point cloud compression – year: 2022 article-title: V3C‐based coding of dynamic meshes – volume: 6 start-page: 443 issue: 3 year: 2009 end-page: 453 article-title: Reconstruction algorithms as a suitable basis for mesh connectivity compression publication-title: IEEE Transactions on Automation Science and Engineering – volume: 23 start-page: 1537 issue: 9 year: 2013 end-page: 1541 article-title: Rate‐distortion model based bit allocation for 3‐D facial compression using geometry video publication-title: IEEE Transactions on Circuits and Systems for Video Technology – volume: 11 start-page: 91 issue: 01 year: 2005 end-page: 120 article-title: The augmented multiresolution Reeb graph approach for content‐based retrieval of 3D shapes publication-title: International Journal of Shape Modeling – year: 2019 article-title: 3D point cloud compression – volume: 14 start-page: 239 issue: 2 year: 1992 end-page: 256 article-title: A method for registration of 3‐D shapes publication-title: IEEE Transactions on Pattern Analysis and Machine Intelligence – start-page: 778 year: 2012 end-page: 785 article-title: Real‐time compression of point cloud streams – start-page: 61 year: 2006 end-page: 70 article-title: Poisson surface reconstruction – year: 2004 article-title: Wavelet compression of parametrically coherent mesh sequences – year: 2020 – year: 2023 – volume: 36 start-page: 808 issue: 7 year: 2012 end-page: 818 article-title: A fast roughness‐based approach to the assessment of 3D mesh visual quality publication-title: Computers & Graphics – volume: 17 start-page: 84 issue: 2 year: 1998 end-page: 115 article-title: Geometric compression through topological surgery publication-title: ACM Transactions on Graphics – year: 2017 – volume: 25 start-page: 1765 issue: 4 year: 2016 end-page: 1778 article-title: Graph‐based compression of dynamic 3D point cloud sequences publication-title: IEEE Transactions on Image Processing – year: 2014 article-title: Low complexity connectivity driven dynamic geometry compression for 3D tele‐immersion – volume: 20 start-page: 343 issue: 2‐3 year: 2009 end-page: 354 article-title: TFAN: A low complexity 3D mesh compression algorithm publication-title: Computer Animation and Virtual Worlds – ident: e_1_2_14_140_2 doi: 10.1145/1399504.1360696 – ident: e_1_2_14_42_2 doi: 10.1109/tcsvt.2003.817625 – ident: e_1_2_14_95_2 – ident: e_1_2_14_143_2 doi: 10.1145/1661412.1618520 – ident: e_1_2_14_100_2 doi: 10.1002/cav.319 – ident: e_1_2_14_137_2 doi: 10.22630/MGV.2014.23.1.4 – ident: e_1_2_14_115_2 – ident: e_1_2_14_44_2 doi: 10.1109/tvcg.2012.308 – ident: e_1_2_14_110_2 doi: 10.1145/1186822.1073237 – ident: e_1_2_14_158_2 doi: 10.1109/VCIP59821.2023.10402678 – ident: e_1_2_14_64_2 – ident: e_1_2_14_69_2 doi: 10.1109/ICMEW53276.2021.9456018 – ident: e_1_2_14_6_2 doi: 10.1016/B978-0-32-391755-1.00024-9 – ident: e_1_2_14_17_2 doi: 10.1109/TASE.2009.2021336 – ident: e_1_2_14_150_2 doi: 10.1109/tcsvt.2011.2158337 – ident: e_1_2_14_154_2 doi: 10.1109/tcsvt.2002.806814 – ident: e_1_2_14_35_2 doi: 10.1145/566654.566591 – ident: e_1_2_14_114_2 doi: 10.1145/2072298.2072349 – ident: e_1_2_14_24_2 doi: 10.1109/ICASSP.2014.6854785 – ident: e_1_2_14_16_2 – ident: e_1_2_14_32_2 doi: 10.1109/3DTV.2010.5506299 – ident: e_1_2_14_89_2 doi: 10.1111/j.1467‐8659.2007.01026.x – ident: e_1_2_14_63_2 – ident: e_1_2_14_97_2 doi: 10.1016/j.cviu.2004.03.012 – ident: e_1_2_14_102_2 doi: 10.1109/VCIP59821.2023.10402693 – ident: e_1_2_14_116_2 doi: 10.1109/2945.764870 – ident: e_1_2_14_14_2 doi: 10.1109/CVPR.2017.591 – ident: e_1_2_14_21_2 doi: 10.1111/cgf.12001 – ident: e_1_2_14_79_2 doi: 10.1145/37401.37422 – ident: e_1_2_14_29_2 doi: 10.1016/j.cag.2021.10.015 – ident: e_1_2_14_92_2 doi: 10.1145/2693443 – ident: e_1_2_14_126_2 doi: 10.1145/1275808.1276478 – ident: e_1_2_14_141_2 doi: 10.1111/cgf.13491 – ident: e_1_2_14_56_2 doi: 10.1109/ICIP.2008.4711937 – ident: e_1_2_14_152_2 doi: 10.1109/CVPR52729.2023.01632 – volume-title: Geometry Processing year: 2007 ident: e_1_2_14_118_2 – ident: e_1_2_14_121_2 doi: 10.1109/ojsp.2022.3160392 – ident: e_1_2_14_85_2 doi: 10.1145/2816795.2818013 – ident: e_1_2_14_71_2 doi: 10.1109/ICASSP48485.2024.10447762 – ident: e_1_2_14_15_2 – ident: e_1_2_14_18_2 – ident: e_1_2_14_22_2 doi: 10.1145/3329714.3338130 – ident: e_1_2_14_31_2 doi: 10.1007/978-3-030-77977-1_4 – ident: e_1_2_14_2_2 doi: 10.1016/j.cviu.2023.103836 – ident: e_1_2_14_131_2 doi: 10.1007/978-3-642-37331-2_37 – ident: e_1_2_14_83_2 doi: 10.1109/tmm.2021.3119872 – ident: e_1_2_14_122_2 doi: 10.1109/TCSVT.2012.2221191 – ident: e_1_2_14_52_2 doi: 10.1109/ICCVW60793.2023.00239 – ident: e_1_2_14_93_2 doi: 10.1007/s41233‐023‐00057‐4 – ident: e_1_2_14_46_2 doi: 10.2174/157489281703220520103556 – ident: e_1_2_14_148_2 doi: 10.1016/j.jvcir.2024.104110 – ident: e_1_2_14_81_2 doi: 10.1109/CVPR52688.2022.00651 – ident: e_1_2_14_67_2 – ident: e_1_2_14_159_2 doi: 10.1109/tcsvt.2020.2985911 – ident: e_1_2_14_13_2 doi: 10.1109/CVPR46437.2021.00150 – ident: e_1_2_14_20_2 doi: 10.1145/2407516.2407540 – ident: e_1_2_14_9_2 doi: 10.1109/VCIP59821.2023.10402714 – ident: e_1_2_14_30_2 doi: 10.1111/cgf.14719 – ident: e_1_2_14_53_2 doi: 10.1109/tcsvt.2014.2313890 – ident: e_1_2_14_74_2 doi: 10.5909/jbe.2024.29.1.42 – ident: e_1_2_14_33_2 doi: 10.1109/MMSP48831.2020.9287057 – ident: e_1_2_14_66_2 – ident: e_1_2_14_10_2 doi: 10.1145/2185520.2185549 – ident: e_1_2_14_127_2 – ident: e_1_2_14_128_2 doi: 10.1109/TIP.2016.2529506 – ident: e_1_2_14_153_2 – ident: e_1_2_14_60_2 – ident: e_1_2_14_5_2 doi: 10.1109/EUVIP53989.2022.9922839 – ident: e_1_2_14_28_2 doi: 10.1007/978-3-031-36027-5_9 – ident: e_1_2_14_19_2 doi: 10.1109/ICTC55196.2022.9952734 – ident: e_1_2_14_149_2 doi: 10.1145/1873951.1874010 – ident: e_1_2_14_54_2 – ident: e_1_2_14_57_2 doi: 10.1109/PCS56426.2022.10018051 – ident: e_1_2_14_105_2 doi: 10.1109/3DTV.2010.5506509 – ident: e_1_2_14_123_2 doi: 10.1109/jetcas.2018.2885981 – ident: e_1_2_14_87_2 doi: 10.1109/TCSVT.2016.2543039 – ident: e_1_2_14_8_2 – ident: e_1_2_14_146_2 doi: 10.1109/EUVIP53989.2022.9922894 – ident: e_1_2_14_73_2 doi: 10.1109/ICRA.2012.6224647 – ident: e_1_2_14_124_2 doi: 10.1109/ISCAS46773.2023.10182003 – ident: e_1_2_14_88_2 doi: 10.1109/ICASSP.2014.6854788 – ident: e_1_2_14_37_2 doi: 10.1145/566570.566589 – ident: e_1_2_14_48_2 doi: 10.1109/ISCAS.2014.6865596 – volume-title: Immersive video technologies year: 2023 ident: e_1_2_14_138_2 – ident: e_1_2_14_76_2 doi: 10.1109/VCIP59821.2023.10402731 – ident: e_1_2_14_120_2 doi: 10.1145/3132705 – ident: e_1_2_14_117_2 doi: 10.1109/lsp.2021.3102525 – ident: e_1_2_14_36_2 doi: 10.1109/ICIP.2017.8296514 – ident: e_1_2_14_101_2 doi: 10.1145/3592786 – ident: e_1_2_14_68_2 doi: 10.1109/tcom.1981.1094950 – ident: e_1_2_14_108_2 – ident: e_1_2_14_39_2 – ident: e_1_2_14_103_2 doi: 10.1109/ICIP49359.2023.10222117 – ident: e_1_2_14_91_2 doi: 10.1109/EUVIP53989.2022.9922888 – ident: e_1_2_14_34_2 doi: 10.5594/jmi.2021.3067962 – ident: e_1_2_14_106_2 doi: 10.1007/978-3-030-58539-6_36 – ident: #cr-split#-e_1_2_14_11_2.1 – ident: e_1_2_14_77_2 doi: 10.1109/access.2022.3197295 – ident: e_1_2_14_151_2 doi: 10.1109/ICIP.2010.5652911 – ident: e_1_2_14_23_2 doi: 10.1109/MMSP48831.2020.9287165 – ident: e_1_2_14_132_2 doi: 10.1117/12.571117 – ident: e_1_2_14_136_2 – ident: e_1_2_14_80_2 doi: 10.1111/j.1467‐8659.2006.00990.x – ident: e_1_2_14_3_2 doi: 10.1049/el:20010993 – ident: e_1_2_14_72_2 – ident: e_1_2_14_109_2 doi: 10.1561/2400000003 – ident: e_1_2_14_75_2 doi: 10.1109/ACCESS.2020.2991478 – ident: e_1_2_14_99_2 doi: 10.1109/CVPR42600.2020.00650 – ident: e_1_2_14_61_2 – ident: e_1_2_14_130_2 doi: 10.1109/tpami.2011.258 – ident: e_1_2_14_125_2 doi: 10.1017/ATSIP.2019.24 – ident: e_1_2_14_135_2 doi: 10.1109/CVPR.2007.383294 – ident: e_1_2_14_156_2 doi: 10.1016/j.cad.2013.08.018 – ident: e_1_2_14_26_2 doi: 10.1007/3DRes.01(2012)2 – ident: e_1_2_14_112_2 doi: 10.1145/3072959.3073711 – ident: #cr-split#-e_1_2_14_11_2.2 – ident: e_1_2_14_41_2 doi: 10.1109/ICIP42928.2021.9506298 – ident: e_1_2_14_82_2 doi: 10.1145/300523.300533 – ident: e_1_2_14_111_2 doi: 10.1109/ICIP40778.2020.9190648 – ident: e_1_2_14_157_2 – ident: e_1_2_14_134_2 doi: 10.1142/s0218654305000748 – ident: e_1_2_14_145_2 doi: 10.1109/TVCG.2010.38 – ident: e_1_2_14_160_2 doi: 10.1109/ICMEW59549.2023.00029 – ident: e_1_2_14_58_2 doi: 10.1155/2009/609350 – ident: e_1_2_14_59_2 – ident: e_1_2_14_139_2 doi: 10.1109/TVCG.2013.22 – ident: e_1_2_14_96_2 doi: 10.1109/3DTV.2008.4547817 – ident: e_1_2_14_50_2 doi: 10.1109/tcsvt.2013.2248971 – ident: e_1_2_14_113_2 – ident: e_1_2_14_78_2 doi: 10.1145/1618452.1618521 – ident: e_1_2_14_90_2 doi: 10.1109/EUVIP53989.2022.9922890 – ident: e_1_2_14_98_2 doi: 10.1007/978-3-540-70517-8_12 – ident: e_1_2_14_104_2 doi: 10.1109/ICCV.2019.00548 – ident: e_1_2_14_40_2 doi: 10.1145/1028523.1028547 – ident: e_1_2_14_84_2 doi: 10.1109/TIP.2019.2931621 – ident: e_1_2_14_107_2 doi: 10.1145/2984511.2984517 – ident: e_1_2_14_119_2 – ident: e_1_2_14_38_2 doi: 10.1145/258734.258849 – ident: e_1_2_14_133_2 doi: 10.1145/274363.274365 – ident: e_1_2_14_27_2 – ident: e_1_2_14_142_2 – ident: e_1_2_14_43_2 doi: 10.3390/electronics12163473 – ident: e_1_2_14_47_2 doi: 10.1109/VCIP.2013.6706442 – ident: e_1_2_14_70_2 doi: 10.1109/ICIP49359.2023.10222073 – ident: e_1_2_14_147_2 doi: 10.1016/j.cag.2012.06.004 – ident: e_1_2_14_62_2 – ident: e_1_2_14_51_2 doi: 10.1109/tcsvt.2014.2329376 – ident: e_1_2_14_55_2 doi: 10.1109/tcsvt.2007.903810 – ident: e_1_2_14_4_2 doi: 10.1111/1467‐8659.00433 – ident: e_1_2_14_49_2 doi: 10.1145/2407746.2407768 – ident: e_1_2_14_65_2 – ident: e_1_2_14_129_2 – ident: e_1_2_14_7_2 doi: 10.1109/TMM.2012.2229264 – ident: e_1_2_14_25_2 doi: 10.1109/TCSVT.2014.2319631 – ident: e_1_2_14_45_2 doi: 10.1109/ICIP46576.2022.9897391 – ident: e_1_2_14_86_2 doi: 10.1109/ICME.2019.00160 – ident: e_1_2_14_94_2 doi: 10.1109/CVPR.2019.00459 – ident: e_1_2_14_12_2 doi: 10.1109/34.121791 – ident: e_1_2_14_155_2 doi: 10.1109/TIP.2006.877413 – ident: e_1_2_14_144_2 doi: 10.1111/j.1467‐8659.2012.03176.x
SSID	ssj0004765
Score	2.4271493
Snippet	Time‐varying meshes (TVMs), that is mesh sequences with varying connectivity, are a greatly versatile representation of shapes evolving in time, as they allow...
SourceID	proquest crossref wiley
SourceType	Aggregation Database Index Database Publisher
SubjectTerms	compression algorithms data compression modelling polygonal mesh reduction Topology
Title	Survey of Inter‐Prediction Methods for Time‐Varying Mesh Compression
URI	https://onlinelibrary.wiley.com/doi/abs/10.1111%2Fcgf.15278 https://www.proquest.com/docview/3171841719
Volume	44
WOSCitedRecordID	wos001395321000001&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/eLvHCXMwpV29TsMwED6VlgEG_hGFUkWIgSVS4yROIiZUCAxQVUBRt8h2bWBJUdJWYuMReEaehLOTtGVAQmKJItlnWWff-Tvf-Q7g1CVMEOlKO5A-tz0aejbzwpFNNDhVhEvFPFNsIuj1wuEw6tfgvHoLU-SHmF-4ackw-loLOOP5kpCLZ6WL9wThCjQcxw113Qbi9RePIgPqV4m9dcqYMq2QDuOZk_48jBYIcxmnmoMm3vzXFLdgo8SX1kWxIbahJtMdWF_KOrgLNw_TbCbfrbGyzH3g18dnP9P-Gr1G1p0pKZ1bCGYt_T4EW59wBkiJTfmLpRVIETub7sEgvnrs3thlQQVbkIiEtvAojxSKrEBYpz2cUegHnChXIKpQSmmvn2RcqE5nFGBHhwrJkI1yRI3d5u5DPR2n8gAsx2Hco5JTgYvpuH6Iw6B-oMwJFEWiJpxUnE3eirwZSWVvIFsSw5YmtCqeJ6Xo5AkCGrQ68RM14cxw9_cBku51bH4O_971CNaIruFrIq9bUJ9kU3kMq2I2ec2zttlDbWhc3seD22-NGcuU
linkProvider	Wiley-Blackwell
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NS8MwFH_MKagHv8Xp1CAevBRsmqYteJHhnLiNgVN2K22WqJdO2m3gzT_Bv9G_xJe03eZBELyUQj4IL3kvv7xPgHOHRoJKR1qedGOLcZ9ZEfOHFtXgVNFYqoiZYhNet-sPBkGvAldlLEyeH2KmcNOcYeS1ZnCtkF7gcvGsdPUez1-CZYa3jD7llPXmUZEed8vM3jpnTJFXSPvxzIb-vI3mEHMRqJqbprn5vzVuwUaBMMl1fiS2oSKTHVhfyDu4C62HSTqV72SkiNEIfn189lJtsdG7RDqmqHRGEM4SHSGCrU-4BByJTdkL0SIk955N9uCxedNvtKyipIIlaEB9SzAeBwqZViCw0zbOwHe9mCpHIK5QSmm7n4xioS4vhx52tLmQEdJRDrl5uTn7UE1GiTwAYttRzLiMucDttB3Xx2lQQvDI9hTHQTU4K0kbvuWZM8LyxYFkCQ1ZalAviR4WzJOFCGnw3YmfoAYXhry_TxA2bpvm5_DvXU9htdXvtMP2Xff-CNaoruhr_LDrUB2nE3kMK2I6fs3SE3OgvgFRPs3f
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1fS8MwED_mJqIP_henU4v44EvBpm3agi-yWSfOMdTJ3kqbJupLN9pt4Jsfwc_oJ_GSttt8EARfSiG5EC65y-9ylzuAM5OEjHCT6w63I92irqWHlhvrRIJTQSIuQksVm3C6XXcw8HoVuCzfwuT5IWYXblIylL6WAs5HsViQcvYiZPUex12CmiWLyFSh1nrw-535u0iH2mVub5k1psgsJCN5ZsQ_z6M5yFyEquqs8Tf-N8tNWC8wpnaVb4otqPBkG9YWMg_uQPtxkk75uzYUmroT_Pr47KXSZyPXSbtXZaUzDQGtJt-IYOszTgEpsSl71aQSyeNnk13o-9dPzbZeFFXQGfGIqzOLRp5AsWUI7aSX03NtJyLCZIgshBDS88fDiImLi9jBjgZlPEQ-8pgq283cg2oyTPg-aIYRRhblEWW4oIZpuzgM6ggaGo6gSFSH05K1wSjPnRGUNgeyJVBsqUOjZHpQiE8WIKhByxM_Xh3OFXt_HyBo3vjq5-DvXU9gpdfyg85t9-4QVoks6asCsRtQHacTfgTLbDp-y9LjYkd9A_FMzvU
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=Survey+of+Inter%E2%80%90Prediction+Methods+for+Time%E2%80%90Varying+Mesh+Compression&rft.jtitle=Computer+graphics+forum&rft.au=Dvo%C5%99%C3%A1k%2C+Jan&rft.au=H%C3%A1cha%2C+Filip&rft.au=Arvanitis%2C+Gerasimos&rft.au=Podgorelec%2C+David&rft.date=2025-02-01&rft.issn=0167-7055&rft.eissn=1467-8659&rft.volume=44&rft.issue=1&rft_id=info:doi/10.1111%2Fcgf.15278&rft.externalDBID=n%2Fa&rft.externalDocID=10_1111_cgf_15278
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