The Community for Technology Leaders
RSS Icon
Issue No.09 - Sept. (2013 vol.19)
pp: 1467-1475
L. Vasa , Fak. fur Inf., Tech. Univ. Chemnitz, Chemnitz, Germany
G. Brunnett , Fak. fur Inf., Tech. Univ. Chemnitz, Chemnitz, Germany
Many algorithms have been proposed for the task of efficient compression of triangular meshes. Geometric properties of the input data are usually exploited to obtain an accurate prediction of the data at the decoder. Considerations on how to improve the prediction usually focus on its normal part, assuming that the tangential part behaves similarly. In this paper, we show that knowledge of vertex valences might allow the decoder to form a prediction that is more accurate in the tangential direction, using a weighted parallelogram prediction. This idea can be easily implemented into existing compression algorithms, such as Edgebreaker, and it can be applied at different levels of sophistication, from very simple ones, that are computationally very cheap, to some more complex ones that provide an even better compression efficiency.
Prediction algorithms, Geometry, Decoding, Encoding, Shape, Equations, Predictive models,valence, Compression, mesh, triangle, parallelogram, prediction
L. Vasa, G. Brunnett, "Exploiting Connectivity to Improve the Tangential Part of Geometry Prediction", IEEE Transactions on Visualization & Computer Graphics, vol.19, no. 9, pp. 1467-1475, Sept. 2013, doi:10.1109/TVCG.2013.22
[1] P. Alliez and M. Desbrun, "Valence-Driven Connectivity Encoding of 3D Meshes," Computer Graphics Forum, vol. 20, pp. 480-489, , 2001.
[2] C. Gotsman, "On the Optimality of Valence-Based Connectivity Coding," Computer Graphics Forum, vol. 22, no. 1, pp. 99-102, 2003.
[3] G. Taubin and J. Rossignac, "Geometric Compression Through Topological Surgery," ACM Trans. Graphics, vol. 17, no. 2, pp. 84-115, , 1998.
[4] C. Touma and C. Gotsman, "Triangle Mesh Compression," Proc. Graphics Interface, pp. 26-34, June 1998.
[5] M. Isenburg, I. Ivrissimtzis, S. Gumhold, and H.-P. Seidel, "Geometry Prediction for High Degree Polygons," Proc. 21st Spring Conf. Computer Graphics (SCCG '05), pp. 147-152, , 2005.
[6] S. Gumhold, S. Guthe, and W. Straßer, "Tetrahedral Mesh Compression with the Cut-Border Machine," Proc. Conf. Visualization '99 (VIS '99), pp. 51-58, 1999.
[7] J. Rossignac, "Edgebreaker: Connectivity Compression for Triangle Meshes," IEEE Trans. Visualization and Computer Graphics, vol. 5, no. 1, pp. 47-61, edgebreaker.html , Jan.-Mar. 1999.
[8] J.-Y. Sim, C.-S. Kim, and S.-U. Lee, "An Efficient 3D Mesh Compression Technique Based on Triangle Fan Structure," Signal Processing: Image Comm., vol. 18, no. 1, pp. 17-32, 2003.
[9] F. Kälberer, K. Polthier, U. Reitebuch, and M. Wardetzky, "Freelence - Coding with Free Valences," Computer Graphics Forum, vol. 24, no. 3, pp. 469-478, 2005.
[10] S. Gumhold and R. Amjoun, "Higher Order Prediction for Geometry Compression," Shape Modeling Int'l, vol. 286, pp. 59-68, 2003.
[11] H. Lee, P. Alliez, and M. Desbrun, "Angle-Analyzer: A Triangle-Quad Mesh Codec," Computer Graph. Forum, vol. 21, no. 3, pp. 383-392, 2002.
[12] C. Courbet and C. Hudelot, "Taylor Prediction for Mesh Geometry Compression," Computer Graphics Forum, vol. 30, no. 1, pp. 139-151, 2010.
[13] R. Pajarola, I.C. Society, and J. Rossignac, "Compressed Progressive Meshes," IEEE Trans. Visualization and Computer Graphics, vol. 6, no. 1, pp. 79-93, Jan.-Mar. 2000.
[14] D. Cohen-Or, R. Cohen, and R. Irony, "Multi-Way Geometry Encoding," technical report, Tel Aviv Univ., 2002.
[15] Z. Karni and C. Gotsman, "Spectral Compression of Mesh Geometry," Proc. 27th Ann. Conf. Computer Graphics and Interactive Techniques (SIGGRAPH '00), pp. 279-286,, 2000.
[16] L. Ibarria, P. Lindstrom, and J. Rossignac, "Spectral Predictors," Proc. Data Compression Conf. (DCC '07), pp. 163-172, http://dx., 2007.
[17] M. Attene, B. Falcidieno, M. Spagnuolo, and J. Rossignac, "Swingwrapper: Retiling Triangle Meshes for Better Edgebreaker Compression," ACM Trans. Graphics, vol. 22, pp. 982-996,, Oct. 2003.
[18] X. Gu, S.J. Gortler, and H. Hoppe, "Geometry Images," ACM Trans. Graphics, vol. 21, pp. 355-361,, July 2002.
[19] O. Sorkine, D. Cohen-Or, and S. Toledo, "High-Pass Quantization for Mesh Encoding," Proc. Eurographics/ACM SIGGRAPH Symp. Geometry Processing, pp. 42-51, 2003.
[20] D. Chen, D. Cohen-Or, O. Sorkine, and S. Toledo, "Algebraic Analysis of High-Pass Quantization," ACM Trans. Graphics, vol. 24, no. 4, pp. 1259-1282, 2005.
[21] M. Isenburg, S. Gumhold, and C. Gotsman, "Connectivity Shapes," Proc. Conf. Visualization '01 (VIS '01), pp. 135-142, http://dl.acm.orgcitation.cfm?id=601671.601691 , 2001.
[22] T.K. Dey and T. Ray, "Polygonal Surface Remeshing with Delaunay Refinement," Eng. with Computers, vol. 26, no. 3, pp. 289-301, , June 2010.
[23] P. Cignoni, C. Rocchini, and R. Scopigno, "Metro: Measuring Error on Simplified Surfaces," technical report, Paris, France, 1996.
[24] D. Chen, Y.-J. Chiang, N. Memon, and X. Wu, "Optimized Prediction for Geometry Compression of Triangle Meshes," Proc. Data Compression Conf. (DCC '05), pp. 83-92, 2005.
[25] B. Kronrod and C. Gotsman, "Optimized Triangle Mesh Compression Using Prediction Trees," Proc. Eighth Pacific Graphics Conf., 2000.
[26] L. Váša, "Optimised Mesh Traversal for Dynamic Mesh Compression," Graphical Models, vol. 73, no. 5, pp. 218-230, , Sept. 2011.
50 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool