Geometry-guided progressive lossless 3D mesh coding with octree (OT) decomposition
ACM SIGGRAPH 2005 Papers
Geometry prediction for high degree polygons
Proceedings of the 21st spring conference on Computer graphics
Mesh connectivity compression using convection reconstruction
Proceedings of the 2007 ACM symposium on Solid and physical modeling
ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
Synthetic Textures for 3D Urban Models in Pededstrian Navigation
Proceedings of the 2008 conference on Techniques and Applications for Mobile Commerce: Proceedings of TAMoCo 2008
A spatio-temporal metric for dynamic mesh comparison
AMDO'06 Proceedings of the 4th international conference on Articulated Motion and Deformable Objects
| Hi-index | 0.00 |
Delphi is a new geometry-guided predictive scheme for compressing the connectivity of triangle meshes. Both compression and decompression algorithms traverse the mesh using the EdgeBreaker state machine. However, instead of encoding the EdgeBreaker clers symbols that capture connectivity explicitly, they estimate the location of the unknown vertex, v, of the next triangle. If the predicted location lies sufficiently close to the nearest vertex, w, on the boundary of the previously traversed portion of the mesh, then Delphi estimates that v coincides with w. When the guess is correct, a single confirmation bit is encoded. Otherwise, additional bits are used to encode the rectification of that prediction. When v coincides with a previously visited vertex that is not adjacent to the parent triangle (EdgeBreaker S case), the offset, which identifies the vertex v, must be encoded, mimicking the cut-border machine compression proposed by Gumhold and Strasser. On models where 97% of Delphi predictions are correct, the connectivity is compressed down to 0.19 bits per triangle. Compression rates decrease with the frequency of wrong predictors, but remains below 1.50 bits per triangle for all models tested.