2009
DOI: 10.1111/j.1467-8659.2009.01507.x
|View full text |Cite
|
Sign up to set email alerts
|

Progressive Lossless Mesh Compression Via Incremental Parametric Refinement

Abstract: Proceedings of Symposium on Geometry Processing SGP 2009International audienceIn this paper, we propose a novel progressive lossless mesh compression algorithm based on Incremental Parametric Refinement, where the connectivity is uncontrolled in a first step, yielding visually pleasing meshes at each resolution level while saving connectivity information compared to previous approaches. The algorithm starts with a coarse version of the original mesh, which is further refined by means of a novel refinement sche… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
50
0

Year Published

2010
2010
2017
2017

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 42 publications
(50 citation statements)
references
References 38 publications
0
50
0
Order By: Relevance
“…several hundreds of vertices) is very difficult to perceive because it causes a low-frequency geometric perturbation. Valette et al [VCP09] and Lee et al [LLD12] considered this principle and applied coarse-tofine quantisation precision in their progressive compression algorithm to improve the rate-distortion trade-off.…”
Section: Use Of Hvs Features For Mesh Compressionmentioning
confidence: 99%
“…several hundreds of vertices) is very difficult to perceive because it causes a low-frequency geometric perturbation. Valette et al [VCP09] and Lee et al [LLD12] considered this principle and applied coarse-tofine quantisation precision in their progressive compression algorithm to improve the rate-distortion trade-off.…”
Section: Use Of Hvs Features For Mesh Compressionmentioning
confidence: 99%
“…In particular, [24] performs well in terms of compression ratio and R-D distortion, at the price of high compression and decompression times (3m for a mesh with 20,000 vertices). The approach of Valette et al [21] also provides very good results: the compression ratio are high and the R-D curve is excellent with the rabbit model, at the price of not guaranteeing the restoration of the initial connectivity. The octree coder [19] gives good compression rates but the distortion is high at low rates.…”
Section: Progressive Compression Of Triangle Meshesmentioning
confidence: 80%
“…Valette et al cast the progressive mesh compression problem as a mesh generation problem [21]. The algorithm starts from a coarse version of the initial mesh that is progressively refined using a Delaunay mesh generation approach.…”
Section: Improving the Rate-distortion Trade-offmentioning
confidence: 99%
“…Further improvements in compression performance was obtained by grouping the individual increments in batches, each batch splitting half of the decoded vertices (Pajarola and Rossignac, 2000). (Peng and Kuo, 2005) and (Valette et al, 2009) present state-of-the-art codecs which allow for fine-grain vertex-by-vertex resolution control.…”
Section: Related Workmentioning
confidence: 99%