Optimized prediction for geometry compression of triangle meshes

Dan Chen, Yi Jen Chiang, Nasir Memon, Xiaolin Wu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper we propose a novel geometry compression technique for 3D triangle meshes. We focus on a commonly used technique for predicting vertex positions via a flipping operation using the parallelogram rule. We show that the efficiency of the flipping operation is dependent on the order in which triangles are traversed and vertices are predicted accordingly. We formulate the problem of optimally (traversing triangles and) predicting the vertices via flippings as a combinatorial optimization problem of constructing a constrained minimum spanning tree. We give heuristic solutions for this problem and show that we can achieve prediction efficiency within 17.4% on average as compared to the unconstrained minimum spanning tree which is an unachievable lower bound. We also show significant improvements over previous techniques in the literature that strive to find good traversals that also attempt to minimize prediction errors obtained by a sequence of flipping operations, albeit using a different approach.

Original languageEnglish (US)
Title of host publicationData Compression Conference Proceedings
EditorsJ.A. Storer, M. Cohn
Pages83-92
Number of pages10
StatePublished - 2005
EventDCC 2005: Data Compression Conference - Snowbird, UT, United States
Duration: Mar 29 2005Mar 31 2005

Other

OtherDCC 2005: Data Compression Conference
CountryUnited States
CitySnowbird, UT
Period3/29/053/31/05

Fingerprint

Geometry
Combinatorial optimization

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture

Cite this

Chen, D., Chiang, Y. J., Memon, N., & Wu, X. (2005). Optimized prediction for geometry compression of triangle meshes. In J. A. Storer, & M. Cohn (Eds.), Data Compression Conference Proceedings (pp. 83-92)

Optimized prediction for geometry compression of triangle meshes. / Chen, Dan; Chiang, Yi Jen; Memon, Nasir; Wu, Xiaolin.

Data Compression Conference Proceedings. ed. / J.A. Storer; M. Cohn. 2005. p. 83-92.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chen, D, Chiang, YJ, Memon, N & Wu, X 2005, Optimized prediction for geometry compression of triangle meshes. in JA Storer & M Cohn (eds), Data Compression Conference Proceedings. pp. 83-92, DCC 2005: Data Compression Conference, Snowbird, UT, United States, 3/29/05.
Chen D, Chiang YJ, Memon N, Wu X. Optimized prediction for geometry compression of triangle meshes. In Storer JA, Cohn M, editors, Data Compression Conference Proceedings. 2005. p. 83-92
Chen, Dan ; Chiang, Yi Jen ; Memon, Nasir ; Wu, Xiaolin. / Optimized prediction for geometry compression of triangle meshes. Data Compression Conference Proceedings. editor / J.A. Storer ; M. Cohn. 2005. pp. 83-92
@inproceedings{39f21b26f5614f7ab73aa3fbefeac264,
title = "Optimized prediction for geometry compression of triangle meshes",
abstract = "In this paper we propose a novel geometry compression technique for 3D triangle meshes. We focus on a commonly used technique for predicting vertex positions via a flipping operation using the parallelogram rule. We show that the efficiency of the flipping operation is dependent on the order in which triangles are traversed and vertices are predicted accordingly. We formulate the problem of optimally (traversing triangles and) predicting the vertices via flippings as a combinatorial optimization problem of constructing a constrained minimum spanning tree. We give heuristic solutions for this problem and show that we can achieve prediction efficiency within 17.4{\%} on average as compared to the unconstrained minimum spanning tree which is an unachievable lower bound. We also show significant improvements over previous techniques in the literature that strive to find good traversals that also attempt to minimize prediction errors obtained by a sequence of flipping operations, albeit using a different approach.",
author = "Dan Chen and Chiang, {Yi Jen} and Nasir Memon and Xiaolin Wu",
year = "2005",
language = "English (US)",
pages = "83--92",
editor = "J.A. Storer and M. Cohn",
booktitle = "Data Compression Conference Proceedings",

}

TY - GEN

T1 - Optimized prediction for geometry compression of triangle meshes

AU - Chen, Dan

AU - Chiang, Yi Jen

AU - Memon, Nasir

AU - Wu, Xiaolin

PY - 2005

Y1 - 2005

N2 - In this paper we propose a novel geometry compression technique for 3D triangle meshes. We focus on a commonly used technique for predicting vertex positions via a flipping operation using the parallelogram rule. We show that the efficiency of the flipping operation is dependent on the order in which triangles are traversed and vertices are predicted accordingly. We formulate the problem of optimally (traversing triangles and) predicting the vertices via flippings as a combinatorial optimization problem of constructing a constrained minimum spanning tree. We give heuristic solutions for this problem and show that we can achieve prediction efficiency within 17.4% on average as compared to the unconstrained minimum spanning tree which is an unachievable lower bound. We also show significant improvements over previous techniques in the literature that strive to find good traversals that also attempt to minimize prediction errors obtained by a sequence of flipping operations, albeit using a different approach.

AB - In this paper we propose a novel geometry compression technique for 3D triangle meshes. We focus on a commonly used technique for predicting vertex positions via a flipping operation using the parallelogram rule. We show that the efficiency of the flipping operation is dependent on the order in which triangles are traversed and vertices are predicted accordingly. We formulate the problem of optimally (traversing triangles and) predicting the vertices via flippings as a combinatorial optimization problem of constructing a constrained minimum spanning tree. We give heuristic solutions for this problem and show that we can achieve prediction efficiency within 17.4% on average as compared to the unconstrained minimum spanning tree which is an unachievable lower bound. We also show significant improvements over previous techniques in the literature that strive to find good traversals that also attempt to minimize prediction errors obtained by a sequence of flipping operations, albeit using a different approach.

UR - http://www.scopus.com/inward/record.url?scp=26944469993&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=26944469993&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:26944469993

SP - 83

EP - 92

BT - Data Compression Conference Proceedings

A2 - Storer, J.A.

A2 - Cohn, M.

ER -