On the optimality of spectral compression of mesh data

ACM Transactions on Graphics

Volumn 24, Issue 1, 2005, Pages 60-80

  Mirela, Ben Chen ^a   Gotsman, Craig ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Laplacian; Spectral decomposition; Triangle mesh

Indexed keywords

CONNECTIVITY GRAPH; SPECTRAL COMPRESSION; SPECTRAL DECOMPOSITION; TRIANGLE MESH;

COMPUTATIONAL GEOMETRY; EIGENVALUES AND EIGENFUNCTIONS; LAPLACE TRANSFORMS; OPTIMIZATION; PRINCIPAL COMPONENT ANALYSIS; SPECTRUM ANALYSIS;

DATA COMPRESSION;

EID: 24944499193     PISSN: 07300301     EISSN: 07300301     Source Type: Journal    
DOI: 10.1145/1037957.1037961     Document Type: Article

References (27)

1. ALEXA, M. AND MÜLLER, W. 2000. Representing animations by principal components. Comput. Graph. For. 19, 3 (Aug.), 411-418.
2. ALPERT, C. J. AND YAO, S. Z. 1995. Spectral partitioning: The more eigenvectors, the better. 32th ACM/IEEE Design Automation Conference, San Francisco, CA. (June) 195-200.
3. ARNOLD, B. C., CASTILLO, E., AND SARABIA, J. 1999. Conditional Specification of Statistical Models. Springer-Verlag.
4. BESAG, J. AND KOOPERBERG, C. 1995. On conditional and intrinsic autoregressions. Biometrika, 82, 4, 733-746.
5. BERA, A. K. AND JARQUE, C. M. 1981. An efficient large-sample test for normality of observations and regression residuals. Working Paper in Economics and Econometrics 40, Australian National University.
6. CHUNG, F. R. K. 1997. Spectral graph theory. Conference Board of Mathematical Science 92. American Mathematical Society.
7. CHUNG, F. R. K. AND YAU, S. T. 2000. Discrete Green's functions. J. Combinator. Theo. A 91 191-214.
8. DAVID, H.A. 1981. Order Statistics. 2nd Ed. Wiley, New York.
9. FLOATER, M. S. 1997. Parameterization and smooth approximation of surface triangulations. Comput. Aided Geometr. Design, 14, 231-250.
10. GOTSMAN, C., GU, X., AND SHEFFER, A. 2003. Fundamentals of spherical parameterization for 3D meshes. In Proceedings of ACM SIGGRAPH 2003.
11. GOTSMAN, C. 2003. On graph partitioning, spectral analysis, and digital mesh processing. In Proceedings of Solid Modeling International.
12. HALL, K. M. 1970. An r-dimensional quadratic placement algorithm. Manage. Science 17, 219-229.
13. HARTFIEL, D. J. AND MEYER, C. D. 1998. On the structure of stochastic matrices with a subdominant eigenvalue near 1. Linear Algebra and Its Appl. 272, 193-203.
14. ISENBURG, M., GUMHOLD, S., AND GOTSMAN, C. 2001. Connectivity shapes. In Proceedings of Visualization 2001.
15. JOLLIFFE, I. T. 1986. Principal Component Analysis. Springer-Verlag, New-York.
16. LAURITZEN, S. 1996. Graphical Models. Oxford University Press.
17. KARNI, Z. AND GOTSMAN, C. 2000. Spectral compression of mesh geometry. In Proceedings of ACM SIGGRAPH 2000, 279-286.
18. KOREN, Y. 2003. On spectral graph drawing. In Proceedings of International Computing and Combinatorics Conference (COCOON'03). Lecture Notes in Computer Science, Vol. 2697, Springer Verlag.
19. PRESS, W. H., TEUKOLSKY, S. A., VETTERLING, W. T., AND FLANNERY, B. P. 1987. Numerical Recipes. Cambridge University Press.
20. PYKE, R. 1965. Spacings. J. Royal Statist. Soc. B, 395-439.
21. RAO, K. R. AND YIP, P. 1990. Discrete Cosine Transform. Academic Press.
22. RICE, J. A. 1988. Mathematical Statistics and Data Analysis. Brooks Cole Publishing.
23. ROSSIGNAC, J. 1999. EdgeBreaker: Connectivity compression for triangle meshes. IEEE Trans. Visual. Comput. Graph., 47-61.
24. TAUBIN, G. 1995. A signal processing approach to fair surface design. Proceedings of ACM SIGGRAPH'1995, 351-358.
25. TAUBIN, G. AND ROSSIGNAC, J. 1998. Geometric compression through topological surgery. ACM Trans. Graph. 17, 2, 84-115.
26. TOUMA, C. AND GOTSMAN, C. 1998. Triangle mesh compression. In Proceedings of Graphics Interface, 26-34.
27. TUTTE, W. T. 1963. How to draw a graph. In Proceedings of the London Mathematical Society 13, 3, 743-768.