Name
Abstract | ||
|---|---|---|
Performances of actual mesh compression algorithms vary significantly depending on the type of model it encodes. These methods rely on prior assumptions on the mesh to be efficient, such as regular connectivity, simple topology and similarity between its elements. However, these priors are implicit in usual schemes, harming their suitability for specific models. In particular, connectivity-driven schemes are difficult to generalize to higher dimensions and to handle topological singularities. GEncode is a new single-rate, geometry-driven compression scheme where prior knowledge of the mesh is plugged into the coder in an explicit manner. It encodes meshes of arbitrary dimension without topological restrictions, but can incorporate topological properties, such as manifoldness, to improve the compression ratio. Prior knowledge of the geometry is taken as an input of the algorithm, represented by a function of the local geometry. This suits particularly well for scanned and remeshed models, where exact geometric priors are available. Compression results surfaces and volumes are competitive with existing schemes. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1111/j.1467-8659.2006.00990.x | COMPUTER GRAPHICS FORUM |
Keywords | Field | DocType |
mesh compression, geometry-driven techniques, arbitrary meshes, arbitrary dimension | Topology,Compression (physics),Polygon mesh,Computer science,GENCODE,Compression ratio,Gravitational singularity,Prior probability,Geometry,Data compression,Lossless compression | Journal |
Volume | Issue | ISSN |
25 | 4 | 0167-7055 |
Citations | PageRank | References |
2 | 0.36 | 32 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Lewiner | 1 | 700 | 43.70 |
| Marcos Craizer | 2 | 57 | 8.90 |
| Hélio Lopes | 3 | 248 | 21.84 |
| Sinésio Pesco | 4 | 44 | 7.20 |
| Luiz Velho | 5 | 1162 | 120.74 |
| Esdras Soares De Medeiros Filho | 6 | 2 | 0.70 |