Efficient compression of non-manifold polygonal meshes

Andre Gueziec, Frank Bossen, Gabriel Taubin, Claudio Silva

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

We present a method for compressing non-manifold polygonal meshes, i.e. polygonal meshes with singularities, which occur very frequently in the real-world. Most efficient polygonal compression methods currently available are restricted to a manifold mesh: they require a conversion process, and fail to retrieve the original model connectivity after decompression. The present method works by converting the original model to a manifold model, encoding the manifold model using an existing mesh compression technique, and clustering, or stitching together during the decompression process vertices that were duplicated earlier to faithfully recover the original connectivity. This paper focuses on efficiently encoding and decoding the stitching information. By separating connectivity from geometry and properties, the method avoids encoding vertices (and properties bound to vertices) multiple times; thus a reduction of the size of the bit-stream of about 10% is obtained compared with encoding the model as a manifold.

Original languageEnglish (US)
Title of host publicationProceedings of the IEEE Visualization Conference
PublisherIEEE
Pages73-80
Number of pages8
StatePublished - 1999
EventProceedings of the IEEE Visualization '99 - San Francisco, CA, USA
Duration: Oct 24 1999Oct 29 1999

Other

OtherProceedings of the IEEE Visualization '99
CitySan Francisco, CA, USA
Period10/24/9910/29/99

Fingerprint

Decoding
Geometry

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this

Gueziec, A., Bossen, F., Taubin, G., & Silva, C. (1999). Efficient compression of non-manifold polygonal meshes. In Proceedings of the IEEE Visualization Conference (pp. 73-80). IEEE.

Efficient compression of non-manifold polygonal meshes. / Gueziec, Andre; Bossen, Frank; Taubin, Gabriel; Silva, Claudio.

Proceedings of the IEEE Visualization Conference. IEEE, 1999. p. 73-80.

Research output: Chapter in Book/Report/Conference proceedingChapter

Gueziec, A, Bossen, F, Taubin, G & Silva, C 1999, Efficient compression of non-manifold polygonal meshes. in Proceedings of the IEEE Visualization Conference. IEEE, pp. 73-80, Proceedings of the IEEE Visualization '99, San Francisco, CA, USA, 10/24/99.
Gueziec A, Bossen F, Taubin G, Silva C. Efficient compression of non-manifold polygonal meshes. In Proceedings of the IEEE Visualization Conference. IEEE. 1999. p. 73-80
Gueziec, Andre ; Bossen, Frank ; Taubin, Gabriel ; Silva, Claudio. / Efficient compression of non-manifold polygonal meshes. Proceedings of the IEEE Visualization Conference. IEEE, 1999. pp. 73-80
@inbook{a4e3e0587f774baea3c4d40d0a562f0f,
title = "Efficient compression of non-manifold polygonal meshes",
abstract = "We present a method for compressing non-manifold polygonal meshes, i.e. polygonal meshes with singularities, which occur very frequently in the real-world. Most efficient polygonal compression methods currently available are restricted to a manifold mesh: they require a conversion process, and fail to retrieve the original model connectivity after decompression. The present method works by converting the original model to a manifold model, encoding the manifold model using an existing mesh compression technique, and clustering, or stitching together during the decompression process vertices that were duplicated earlier to faithfully recover the original connectivity. This paper focuses on efficiently encoding and decoding the stitching information. By separating connectivity from geometry and properties, the method avoids encoding vertices (and properties bound to vertices) multiple times; thus a reduction of the size of the bit-stream of about 10{\%} is obtained compared with encoding the model as a manifold.",
author = "Andre Gueziec and Frank Bossen and Gabriel Taubin and Claudio Silva",
year = "1999",
language = "English (US)",
pages = "73--80",
booktitle = "Proceedings of the IEEE Visualization Conference",
publisher = "IEEE",

}

TY - CHAP

T1 - Efficient compression of non-manifold polygonal meshes

AU - Gueziec, Andre

AU - Bossen, Frank

AU - Taubin, Gabriel

AU - Silva, Claudio

PY - 1999

Y1 - 1999

N2 - We present a method for compressing non-manifold polygonal meshes, i.e. polygonal meshes with singularities, which occur very frequently in the real-world. Most efficient polygonal compression methods currently available are restricted to a manifold mesh: they require a conversion process, and fail to retrieve the original model connectivity after decompression. The present method works by converting the original model to a manifold model, encoding the manifold model using an existing mesh compression technique, and clustering, or stitching together during the decompression process vertices that were duplicated earlier to faithfully recover the original connectivity. This paper focuses on efficiently encoding and decoding the stitching information. By separating connectivity from geometry and properties, the method avoids encoding vertices (and properties bound to vertices) multiple times; thus a reduction of the size of the bit-stream of about 10% is obtained compared with encoding the model as a manifold.

AB - We present a method for compressing non-manifold polygonal meshes, i.e. polygonal meshes with singularities, which occur very frequently in the real-world. Most efficient polygonal compression methods currently available are restricted to a manifold mesh: they require a conversion process, and fail to retrieve the original model connectivity after decompression. The present method works by converting the original model to a manifold model, encoding the manifold model using an existing mesh compression technique, and clustering, or stitching together during the decompression process vertices that were duplicated earlier to faithfully recover the original connectivity. This paper focuses on efficiently encoding and decoding the stitching information. By separating connectivity from geometry and properties, the method avoids encoding vertices (and properties bound to vertices) multiple times; thus a reduction of the size of the bit-stream of about 10% is obtained compared with encoding the model as a manifold.

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

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

M3 - Chapter

AN - SCOPUS:0033331193

SP - 73

EP - 80

BT - Proceedings of the IEEE Visualization Conference

PB - IEEE

ER -