We present a novel measure for compression of time-variant geometry. Compression of time-variant geometry has become increasingly relevant as transmission of high quality geometry streams is severely limited by network bandwidth. Some work has been done on such compression schemes, but none of them give a measure for prioritizing the loss of information from the geometry stream while doing a lossy compression. In this paper we introduce a cost function which assigns a cost to the removal of particular geometric primitives during compression, based upon their importance in preserving the complete animation. We demonstrate that the use of this measure visibly enhances the performance of existing compression schemes
An efficient algorithm for compression of dynamic time-consistent 3D meshes is presented. Such a seq...
International audienceWe introduce in this paper a compression process to encode the geometry of 3D ...
We propose a new progressive compression scheme for arbitrary topology, highly detailed and densely ...
We introduce in this paper a new compression process to en-code the geometry of 3D mesh sequences (w...
Abstract — In this paper we investigate the problem of lossless geometry compression of irregular-gr...
In distributed environments, efficient visual information sharing is critical for effective communic...
The maximum compression, efficient transmission and fast rendering of geometric models is a complex ...
Geometry based 3D Tele-Immersion is a novel emerging media application that involves on the fly reco...
National audience3D graphics data are more and more complex due to an increasing precision in their ...
Live 3D reconstruction of a human as a 3D mesh with commodity electronics is becoming a reality. Imm...
In distributed environments, efficient visual information sharing is critical for effective communic...
Representing geometry data as voxels allows for a massive amount of detail that can be rendered in r...
International audienceRecent advances in digitization of geometry and radiometry generate in routine...
Geometry compression concerns the representation of three-dimensional objects. The goal of geometry ...
Compression techniques for triangle-mesh representations of 3D models have been the focus of many re...
An efficient algorithm for compression of dynamic time-consistent 3D meshes is presented. Such a seq...
International audienceWe introduce in this paper a compression process to encode the geometry of 3D ...
We propose a new progressive compression scheme for arbitrary topology, highly detailed and densely ...
We introduce in this paper a new compression process to en-code the geometry of 3D mesh sequences (w...
Abstract — In this paper we investigate the problem of lossless geometry compression of irregular-gr...
In distributed environments, efficient visual information sharing is critical for effective communic...
The maximum compression, efficient transmission and fast rendering of geometric models is a complex ...
Geometry based 3D Tele-Immersion is a novel emerging media application that involves on the fly reco...
National audience3D graphics data are more and more complex due to an increasing precision in their ...
Live 3D reconstruction of a human as a 3D mesh with commodity electronics is becoming a reality. Imm...
In distributed environments, efficient visual information sharing is critical for effective communic...
Representing geometry data as voxels allows for a massive amount of detail that can be rendered in r...
International audienceRecent advances in digitization of geometry and radiometry generate in routine...
Geometry compression concerns the representation of three-dimensional objects. The goal of geometry ...
Compression techniques for triangle-mesh representations of 3D models have been the focus of many re...
An efficient algorithm for compression of dynamic time-consistent 3D meshes is presented. Such a seq...
International audienceWe introduce in this paper a compression process to encode the geometry of 3D ...
We propose a new progressive compression scheme for arbitrary topology, highly detailed and densely ...