Efficient coding of repeated mesh connected components via connectivity skip and prediction refinement

Repeated connected components exist in meshes, especially in digitally created contents (DCC). These connected components share the same connectivity and are typically related by a rigid transformation (rotation and/or translation). Encoding the same connectivity multiple times is redundant. In addition, the existence of rigid transform among repeated connected components can be exploited to better predict vertex positions. In this paper, we first propose to concurrently encode mesh connected components which share the same connectivity. The input mesh is examined and connected components with the same connectivity are grouped together. Then, for each group, the shared connectivity is coded followed by coding positions of all the vertices within the group. Secondly, a prediction refinement scheme is proposed in which the residue of an already encoded vertex improves the prediction of its corresponding vertex in another connected component within the same group.

Authors

Institutions

Publication Details

Published
2025-09-16
DOI
https://doi.org/10.1117/12.3063692
Primary Topic
Interconnection Networks and Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient coding of repeated mesh connected components via connectivity skip and prediction refinement

Shan Liu, Chao Huang, Pranav Kadam
Interconnection Networks and Systems
article

Efficient coding of repeated mesh connected components via connectivity skip and prediction refinement

Shan Liu, Chao Huang, Pranav Kadam
article en

Abstract

Repeated connected components exist in meshes, especially in digitally created contents (DCC). These connected components share the same connectivity and are typically related by a rigid transformation (rotation and/or translation). Encoding the same connectivity multiple times is redundant. In addition, the existence of rigid transform among repeated connected components can be exploited to better predict vertex positions. In this paper, we first propose to concurrently encode mesh connected components which share the same connectivity. The input mesh is examined and connected components with the same connectivity are grouped together. Then, for each group, the shared connectivity is coded followed by coding positions of all the vertices within the group. Secondly, a prediction refinement scheme is proposed in which the residue of an already encoded vertex improves the prediction of its corresponding vertex in another connected component within the same group.

KLA (United States) (US)
Openalex Percentile: Top 71%
Interconnection Networks and Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.