Geometry prediction for high degree polygons

Spring Conference on Computer Graphics, SCCG 2005 - Conference Proceedings

Volumn , Issue , 2005, Pages 147-152

  Isenburg, Martin ^a   Ivrissimtzis, Ioannis ^a   Gumhold, Stefan ^a   Seidel, Hans Peter ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Mesh compression; Predictive geometry coding

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; FOURIER TRANSFORMS; NATURAL FREQUENCIES;

LORENZO PREDICTOR; MESH COMPRESSION; PARALLELOGRAM RULE; PREDICTIVE GEOMETRY CODING;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 33749015216     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1090122.1090146     Document Type: Conference Paper

References (23)

1. BERLEKAMP, E., GILBERT, E., AND SINDEN, F. 1965. A polygon problem. Amer. Math. Monthly 72, 233-241.
2. CHAZELLE, B. 2000. The Discrepancy Method - Randomness and Complexity. Cambridge University Press.
3. COHEN-OR, D., COHEN, R., AND IRONY, R. 2002. Multi-way geometry encoding. Tech. rep., Computer Science, Tel Aviv University.
4. COORS, V., AND ROSSIGNAC, J. 2004. Delphi: Geometry-based connectivity prediction in triangle mesh compression. The Visual Computer 20, 8-9, 507-520.
5. DAVIS, P. 1979. Circulant matrices. Wiley-Interscience.
6. DEVILLERS, O., AND GANDOIN, P.-M. 2002. Progressive and lossless compression of arbitrary simplicial complexes. In SIGGRAPH'02 Conference Proceedings, 372-379.
7. IBARRIA, L., LINDSTROM, P., ROSSIGNAC, J., AND SZYMCZAK, A. 2003. Out-of-core compression and decompression of large n-dimensional scalar fields. In Eurographics'03 Proceedings, 343-348.
8. ISENBURG, M., AND ALLIEZ, P. 2002. Compressing polygon mesh geometry with parallelogram prediction. In Visualization'02 Conference Proceedings. 141-146.
9. ISENBURG, M., AND GUMHOLD, S. 2003. Out-of-core compression for gigantic polygon meshes. In SIGGRAPH'03 Proceedings, 935-942.
10. ISENBURG, M., AND SNOEYINK, J. 2000. Face Fixer: Compressing polygon meshes with properties. In SIGGRAPH'00 Proceedings, 263-270.
11. ISENBURG, M., AND SNOEYINK, J. 2005. Early-split coding of triangle mesh connectivity, manuscript.
12. ISENBURG, M. 2002. Compressing polygon mesh connectivity with degree duality prediction. In Graphics Interface'02 Proceedings, 161-170.
13. KÄLBERER, F., POLTHIER, K., REITEBUCH, U., AND WARDETZKY, M. 2005. Freelence: Compressing triangle meshes using geometric information, to appear in Eurographics '05 Proceedings, September 2005.
14. KARNI, Z., AND GOTSMAN, C. 2000. Spectral compression of mesh geometry. In SIGGRAPH'00 Conference Proceedings, 279-286.
15. KHODAKOVSKY, A., SCHROEDER, P., AND SWELDENS, W. 2000. Progressive geometry compression. In SIGGRAPH'00 Proceedings, 271-278.
16. KHODAKOVSKY, A., ALLIEZ, P., DESBRUN, M., AND SCHROEDER, P. 2002. Near-optimal connectivity encoding of 2-manifold polygon meshes. Graphical Models 64, 3-4, 147-168.
17. KRONROD, B., AND GOTSMAN, C. 2002. Optimized compression of triangle mesh geometry using prediction trees. In International Symposium on 3D Data Processing Visualization and Transmission, 602-608.
18. LEE, H., ALLIEZ, P., AND DESBRUN, M. 2002. Angle-analyzer: A triangle-quad mesh codec. In Eurographics'02 Proceedings, 198-205.
19. SHIKHARE, D., BHAKAR, S., AND MUDUR, S. 2001. Compression of 3D engineering models using automatic discovery of repeating geometric features. In Proc. of Vision Modeling and Visualization'01, 233-240.
20. SORKINE, O., COHEN-OR, D., AND TOLEDO, S. 2003. High-pass quantization for mesh encoding. In Proceedings of Symposium on Geometry Processing'03, 42-51.
21. SURAZHSKY, V., ALLIEZ, P., AND GOTSMAN, C. 2003. Isotropic remeshing of surfaces: a local parameterization approach. In Proceedings of 12th International Meshing Roundtable, 215-224.
22. TOUMA, C., AND GOTSMAN, C. 1998. Triangle mesh compression. In Graphics Interface'98 Conference Proceedings, 26-34.
23. WITTEN, I. H., NEAL, R. M., AND CLEARY, J. G. 1987. Arithmetic coding for data compression. Communications of the ACM 30, 6, 520-540.