Geometry compression of tetrahedral meshes using optimized prediction

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 volumetric datasets represented as tetrahedral meshes. We focus on a commonly used technique for predicting vertex geometries via a fiipping operation using an extension of the parallelogram rule. We demonstrate that the efficiency of the fiipping operation is dependent on the order in which tetrahedra are traversed and vertices are predicted accordingly. We formulate the problem of optimally (traversing tetrahedra and) predicting the vertices via fiippings 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 very close to that of the unconstrained minimum spanning tree which is an unachievable lower bound. We also show significant improvements of our new geometry compression over the state-of-the-art fiipping approach, whose traversal order does not take into account the geometry of the mesh.

Original languageEnglish (US)
Title of host publication13th European Signal Processing Conference, EUSIPCO 2005
Pages1906-1909
Number of pages4
StatePublished - 2005
Event13th European Signal Processing Conference, EUSIPCO 2005 - Antalya, Turkey
Duration: Sep 4 2005Sep 8 2005

Other

Other13th European Signal Processing Conference, EUSIPCO 2005
CountryTurkey
CityAntalya
Period9/4/059/8/05

Fingerprint

Geometry
Combinatorial optimization

ASJC Scopus subject areas

  • Signal Processing

Cite this

Chen, D., Chiang, Y. J., Memon, N., & Wu, X. (2005). Geometry compression of tetrahedral meshes using optimized prediction. In 13th European Signal Processing Conference, EUSIPCO 2005 (pp. 1906-1909)

Geometry compression of tetrahedral meshes using optimized prediction. / Chen, Dan; Chiang, Yi Jen; Memon, Nasir; Wu, Xiaolin.

13th European Signal Processing Conference, EUSIPCO 2005. 2005. p. 1906-1909.

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

Chen, D, Chiang, YJ, Memon, N & Wu, X 2005, Geometry compression of tetrahedral meshes using optimized prediction. in 13th European Signal Processing Conference, EUSIPCO 2005. pp. 1906-1909, 13th European Signal Processing Conference, EUSIPCO 2005, Antalya, Turkey, 9/4/05.
Chen D, Chiang YJ, Memon N, Wu X. Geometry compression of tetrahedral meshes using optimized prediction. In 13th European Signal Processing Conference, EUSIPCO 2005. 2005. p. 1906-1909
Chen, Dan ; Chiang, Yi Jen ; Memon, Nasir ; Wu, Xiaolin. / Geometry compression of tetrahedral meshes using optimized prediction. 13th European Signal Processing Conference, EUSIPCO 2005. 2005. pp. 1906-1909
@inproceedings{9ecaa7e217474689a884170d5af1acdd,
title = "Geometry compression of tetrahedral meshes using optimized prediction",
abstract = "In this paper we propose a novel geometry compression technique for volumetric datasets represented as tetrahedral meshes. We focus on a commonly used technique for predicting vertex geometries via a fiipping operation using an extension of the parallelogram rule. We demonstrate that the efficiency of the fiipping operation is dependent on the order in which tetrahedra are traversed and vertices are predicted accordingly. We formulate the problem of optimally (traversing tetrahedra and) predicting the vertices via fiippings 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 very close to that of the unconstrained minimum spanning tree which is an unachievable lower bound. We also show significant improvements of our new geometry compression over the state-of-the-art fiipping approach, whose traversal order does not take into account the geometry of the mesh.",
author = "Dan Chen and Chiang, {Yi Jen} and Nasir Memon and Xiaolin Wu",
year = "2005",
language = "English (US)",
isbn = "1604238216",
pages = "1906--1909",
booktitle = "13th European Signal Processing Conference, EUSIPCO 2005",

}

TY - GEN

T1 - Geometry compression of tetrahedral meshes using optimized prediction

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 volumetric datasets represented as tetrahedral meshes. We focus on a commonly used technique for predicting vertex geometries via a fiipping operation using an extension of the parallelogram rule. We demonstrate that the efficiency of the fiipping operation is dependent on the order in which tetrahedra are traversed and vertices are predicted accordingly. We formulate the problem of optimally (traversing tetrahedra and) predicting the vertices via fiippings 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 very close to that of the unconstrained minimum spanning tree which is an unachievable lower bound. We also show significant improvements of our new geometry compression over the state-of-the-art fiipping approach, whose traversal order does not take into account the geometry of the mesh.

AB - In this paper we propose a novel geometry compression technique for volumetric datasets represented as tetrahedral meshes. We focus on a commonly used technique for predicting vertex geometries via a fiipping operation using an extension of the parallelogram rule. We demonstrate that the efficiency of the fiipping operation is dependent on the order in which tetrahedra are traversed and vertices are predicted accordingly. We formulate the problem of optimally (traversing tetrahedra and) predicting the vertices via fiippings 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 very close to that of the unconstrained minimum spanning tree which is an unachievable lower bound. We also show significant improvements of our new geometry compression over the state-of-the-art fiipping approach, whose traversal order does not take into account the geometry of the mesh.

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

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

M3 - Conference contribution

AN - SCOPUS:84863712438

SN - 1604238216

SN - 9781604238211

SP - 1906

EP - 1909

BT - 13th European Signal Processing Conference, EUSIPCO 2005

ER -