| Title: | Survey of inter-prediction methods for time-varying mesh compression |
|---|
| Authors: | ID Dvořák, Jan (Author)
ID Hácha, Filip (Author)
ID Arvanitis, Gerasimos (Author)
ID Podgorelec, David (Author)
ID Moustakas, Konstantinos (Author)
ID Váša, Libor (Author) |
|---|
| Files: |  Computer_Graphics_Forum_-_2025_-_Dvořak_-_Survey_of_Inter‐Prediction_Methods_for_Time‐Varying_Mesh_Compression.pdf (3,11 MB)
MD5: 2157FCE3B1F2B4552D6C4960D15A3776
|
|---|
| Language: | English |
|---|
| Work type: | Article |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | FERI - Faculty of Electrical Engineering and Computer Science
|
|---|
| Abstract: | Time-varying meshes (TVMs), that is mesh sequences with varying connectivity, are a greatly versatile representation of shapesevolving 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. Whilethe problem may seem trivial at first sight, considering the strong temporal coherence of shapes represented by the individualframes, it turns out that the varying connectivity and the absence of implicit correspondence information that stems from itmakes it rather difficult to exploit the redundancies present in the data. Therefore, efficient and general TVM compression is stillconsidered an open problem. We describe and categorize existing approaches while pointing out the current challenges in thefield and hint at some related techniques that might be helpful in addressing them. We also provide an overview of the reportedperformance of the discussed methods and a list of datasets that are publicly available for experiments. Finally, we also discusspotential future trends in the field. |
|---|
| Keywords: | compression algorithms, data compression, modelling, polygonal mesh reduction |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Publication date: | 13.01.2018 |
|---|
| Publisher: | Wiley |
|---|
| Year of publishing: | 2025 |
|---|
| Number of pages: | 30 str. |
|---|
| Numbering: | Vol. 37, no. 1 |
|---|
| PID: | 20.500.12556/DKUM-91801  |
|---|
| UDC: | 004.94 |
|---|
| ISSN on article: | 1467-8659 |
|---|
| COBISS.SI-ID: | 223210499 |
|---|
| DOI: | 10.1111/cgf.15278 |
|---|
| Note: | © 2025 The Author(s) |
|---|
| Publication date in DKUM: | 07.02.2025 |
|---|
| Views: | 134 |
|---|
| Downloads: | 9 |
|---|
| Metadata: |    |
|---|
| Categories: | Misc.
|
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
