Optimized compression of triangle mesh geometry using prediction trees

B. Kronrod, C. Gotsman

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

35 Scopus citations

Abstract

Almost all triangle mesh compression algorithms to date are driven by the mesh connectivity code. The geometry code usually employs a straightforward prediction method applied to the vertex sequence as dictated by the connectivity code. This generates a suboptimal geometry code, which results in significant loss in code efficiency, since the geometry dominates the mesh information content. The paper proposes a manifold mesh code which optimizes the geometric component, at the slight expense of the connectivity code. This mesh geometry code is shown to be up to 50% more compact than the state-of-the-art geometry code of Touma and Gotsman (1998), especially for models with non-smooth geometry, such as CAD models.

Original languageEnglish (US)
Title of host publicationProceedings - 1st International Symposium on 3D Data Processing Visualization and Transmission, 3DPVT 2002
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages602-608
Number of pages7
ISBN (Electronic)0769515215, 9780769515212
DOIs
StatePublished - 2002
Externally publishedYes
Event1st International Symposium on 3D Data Processing Visualization and Transmission, 3DPVT 2002 - Padova, Italy
Duration: Jun 19 2002Jun 21 2002

Publication series

NameProceedings - 1st International Symposium on 3D Data Processing Visualization and Transmission, 3DPVT 2002

Other

Other1st International Symposium on 3D Data Processing Visualization and Transmission, 3DPVT 2002
CountryItaly
CityPadova
Period6/19/026/21/02

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Computer Vision and Pattern Recognition
  • Signal Processing

Fingerprint Dive into the research topics of 'Optimized compression of triangle mesh geometry using prediction trees'. Together they form a unique fingerprint.

Cite this