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

Simple item page
dc.contributor.authorDvořák, Janen_US
dc.contributor.authorHácha, Filipen_US
dc.contributor.authorArvanitis, Gerasimosen_US
dc.contributor.authorPodgorelec, Daviden_US
dc.contributor.authorMoustakas, Konstantinosen_US
dc.contributor.authorVáša, Liboren_US
dc.date.accessioned2025-03-07T16:49:34Z
dc.date.available2025-03-07T16:49:34Z
dc.date.issued2025
dc.description.abstractTime‐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.en_US
dc.description.number1
dc.description.sectionheadersMajor Revision from Eurographics Conference
dc.description.seriesinformationComputer Graphics Forum
dc.description.volume44
dc.identifier.doi10.1111/cgf.15278
dc.identifier.issn1467-8659
dc.identifier.pages30
dc.identifier.urihttps://doi.org/10.1111/cgf.15278
dc.identifier.urihttps://diglib.eg.org/handle/10.1111/cgf15278
dc.publisherEurographics ‐ The European Association for Computer Graphics and John Wiley & Sons Ltd.en_US
dc.rightsAttribution 4.0 International License
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.subjectcompression algorithms
dc.subjectdata compression
dc.subjectmodelling
dc.subjectpolygonal mesh reduction
dc.subject• Computing methodologies → Animation; Mesh models; • Theory of computation → Data compression
dc.titleSurvey of Inter‐Prediction Methods for Time‐Varying Mesh Compressionen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
29_cgf15278.pdf
Size:
2.91 MB
Format:
Adobe Portable Document Format
Download
Collections
44-Issue 1