In this work, we propose improvements on a state-of-the-art scheme for progressive triangular mesh compression, which is based on hierarchical vertex clustering. Specifically, we fix several shortcomings of that scheme including quantization error accumulation, false facet generation and lack of facet orientation encoding. In addition, the resultant mesh encoder yields better rate-distortion performance than another state-of-the-art one on our test model, as demonstrated by the experiments.EICPCI-S(ISTP)wgp@pku.edu.cn; wuyz145@gmail.com; sulepluto@gmail.com; jpeng@sdu.edu.cnSeptmber2014-Septembe
AbstractA new progressive compression algorithm for arbitrary topology with highly detailed triangle...
For a few years, meshes have been conquering a predominant status amongst the different types of com...
International audienceWe propose a new connectivity-based progressivecompression approach for triang...
International audienceThis paper presents a new lossless, cluster-based randomly-accessible and prog...
In this paper, we present two methods to compress colored 3D triangular meshes in a progressive way....
In this paper, we present two methods to compress colored 3D triangular meshes in a progressive way....
International audienceThis paper details the first publicly available implementation of the progress...
International audienceThis paper presents a new algorithm for the progressive compression of manifol...
Previous work on progressive mesh compression focused on triangle meshes but meshes containing other...
International audienceThis paper presents a new algorithm for the progressive compression of manifol...
Most systems that support the visual interaction with 3D models use shape representations based on t...
International audienceThis paper proposes a new lossy to lossless progressive compression scheme for...
We propose a new progressive compression scheme for arbitrary topology, highly detailed and densely ...
In this paper we introduce the Progressive Forest Split (PFS) representation, a new adaptive refinem...
We propose a new progressive compression scheme for arbitrary topology, highly detailed and densely ...
AbstractA new progressive compression algorithm for arbitrary topology with highly detailed triangle...
For a few years, meshes have been conquering a predominant status amongst the different types of com...
International audienceWe propose a new connectivity-based progressivecompression approach for triang...
International audienceThis paper presents a new lossless, cluster-based randomly-accessible and prog...
In this paper, we present two methods to compress colored 3D triangular meshes in a progressive way....
In this paper, we present two methods to compress colored 3D triangular meshes in a progressive way....
International audienceThis paper details the first publicly available implementation of the progress...
International audienceThis paper presents a new algorithm for the progressive compression of manifol...
Previous work on progressive mesh compression focused on triangle meshes but meshes containing other...
International audienceThis paper presents a new algorithm for the progressive compression of manifol...
Most systems that support the visual interaction with 3D models use shape representations based on t...
International audienceThis paper proposes a new lossy to lossless progressive compression scheme for...
We propose a new progressive compression scheme for arbitrary topology, highly detailed and densely ...
In this paper we introduce the Progressive Forest Split (PFS) representation, a new adaptive refinem...
We propose a new progressive compression scheme for arbitrary topology, highly detailed and densely ...
AbstractA new progressive compression algorithm for arbitrary topology with highly detailed triangle...
For a few years, meshes have been conquering a predominant status amongst the different types of com...
International audienceWe propose a new connectivity-based progressivecompression approach for triang...