Algebraic analysis of high-pass quantization

ACM Transactions on Graphics

Volumn 24, Issue 4, 2005, Pages 1259-1282

  Chen, Doron ^a   Cohen Or, Daniel ^a   Sorkine, Olga ^a   Toledo, Sivan ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Mesh geometry; Quantization; Topological Laplacian operator

Indexed keywords

ANCHOR-SELECTION ALGORITHM; MESH GEOMETRY; QUANTIZATION; TOPOLOGICAL LAPLACIAN OPERATOR;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; MATRIX ALGEBRA; TOPOLOGY; VECTORS;

ALGEBRA;

EID: 33645780429     PISSN: 07300301     EISSN: 07300301     Source Type: Conference Proceeding    
DOI: 10.1145/1095878.1095880     Document Type: Article

References (54)

1. ALLJEZ, P. AND DESBRUN, M. 2001. Valence-driven connectivity encoding for 3D meshes. Comput. Graph. For. 20, 3, 480-489.
2. ALLIEZ, P. AND GOTSMAN, C. 2005. Recent advances in compression of 3D meshes. In Advances in Multiresolution for Geometric Modelling, N. Dodgson, M. Floater, and M. Sabin, Eds. Springer-Verlag, 3-26.
3. AXELSSON, O. 1994. Iterative Solution Methods. Cambridge University Press, Cambridge, UK.
4. BARRET, R., BERRY, M., CHAN, T., DEMMEL, J., DONATO, J., DONGARRA, J., EIJKHOUT, V., Pozo, R., ROMINE, C., AND VAN DER VORST, H. 1993. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. SIAM, Philadeplphia, PA.
5. BEN-CHEN, M. AND GOTSMAN, C. 2005. On the optimality of spectral compression of mesh data. ACM Trans. Graph. 24,1, 60-80.
6. BERN, M., GILBERT, J. R., HENDRICKSON, B., NGUYEN, N., AND TOLEDO, S. 2001. Support-graph preconditioners. SIAM J. Matrix Anal. Appl. Submitted for publication.
7. BJÖRCK, Å. 1996. Numerical Methods for Least Squares Problems. SIAM, Philadelphia, PA.
8. BJÖRCK, Å. AND ELFVING, T. 1979. Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations. BIT 19, 145-163.
9. BOMAN, E. G., CHEN, D., HENDRICKSON, B., AND TOLEDO, S. 2004. Maximum-weight-basis preconditioners. Numer. Linear Algeb. Appl. 11, 695-721.
10. BOMAN, E. G. AND HENDRICKSON, B. 2003. Support theory for preconditioning. SIAM J. Matrix Anal. Appl. 25, 3, 694-717.
11. BRAINMAN, I. AND TOLEDO, S. 2002. Nested-dissection orderings for sparse LU with partial pivoting. SIAM J. Matrix Anal. Appl. 23, 998-112.
12. BRANDT, A., MCCORMICK, S. F., AND RUGE, J. 1984. Algebraic multigrid (AMG) for sparse matrix equations. In Sparsity and its Applications, D. J. Evans, Ed. Cambridge University Press, Cambridge, UK. 257-284.
13. BRIGGS, W. L., HENSON, V. E., AND MCCORMICK, S. F. 2000. A Multigrid Tutorial, 2nd Ed. SIAM, Philadelphia, PA.
14. CHEN, D. AND TOLEDO, S. 2003. Vaidya's preconditioners: Implementation and experimental study. Electr. Trans. Numer. Anal. 16, 30-49.
15. CHOU, P. H. AND MENG, T. H. 2002. Vertex data compression through vector quantization. IEEE Trans. Visual. Comput. Graph. 8, 4, 373-382.
16. CHUNG, F. R. K. 1997. Spectral Graph Theory. American Methematical Society.
17. CRAIG, E. J. 1955. The n-step iteration procedure. J. Math. Phys. 34, 65-73.
18. DAVIS, T. A., GILBERT, J. R., LARIMORE, S. I., AND NG, E. G. 2004. A column approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30, 3, 353-376.
19. ELFVING, T. 1978. On the conjugate gradient method for solving linear least squares problems. Tech. rep. LiTH-MAT-R-78-3, Linköping University, Sweden.
20. FIEDLER, M. 1973. Algebraic connectivity of graphs. Czech. Math. J. 23, 298-305.
21. GEORGE, J. A. AND HEATH, M. T. 1980. Solution of sparse linear least squares problems using Givens rotations. Linear Algeb. Appl. 34, 69-83.
22. GEORGE, J. A. AND NG, E. G. 1983. On row and column orderings for sparse least squares problems. SIAM J. Numer. Anal. 20, 326-344.
23. GEORGE, J. A. AND NG, E. G. 1986. Orthogonal reduction of sparse matrices to upper triangular form using Householder transformations. SIAM J. Sci. Statist. Comput. 7, 460-472.
24. GEORGE, J. A. AND NG, E. G. 1988. On the complexity of sparse QR and LU factorization of finite-element matrices. SIAM J. Sci. Statist. Comput. 9, 849-861.
25. GOLUB, G. H. AND LOAN, C. F. V. 1996. Matrix Computations, 3rd Ed. Johns Hopkins University Press.
26. GREMBAN, K., MILLER, G., AND ZAGHA, M. 1995. Performance evaluation of a parallel preconditioner. In IEEE 9th International Parallel Processing Symposium. Santa Barbara, CA. 65-69.
27. GREMBAN, K. D. 1996. Combinatorial preconditioners for sparse, symmetric, diagonally dominant linear systems. Ph.D. thesis, School of Computer Science, Carnegie Mellon University.
28. GUATTERY, S. AND MILLER, G. L. 2000. Graph embeddings and laplacian eigenvalues. SIAM J. Matrix Anal. Appl. 21, 3, 703-723.
29. GUMHOLD, S. 2000. New bounds on the encoding of planar triangulations. Technical rep. WSI-2000-1, (Jan.) Wilhelm-Schickard-Institut für Informatik, University of Tübingen, Germany.
30. GUSKOV, I., VIDIMČE, K., SWELDENS, W., AND SCHRÖDER, P. 2000. Normal meshes. In Proceedings of ACM SIGGRAPH. 95-102.
31. GUSTAFSSON, I. 1978. A class of first-order factorization methods. BIT 18, 142-156.
32. HEGGERNES, P. AND MATSTOMS, P. 1996. Finding good column orderings for sparse QR factorizations. Tech. rep. LiTH-MAT-1996-20, Department of Mathematics, Linköping University, Sweden.
33. HIGHAM, N. J. 2002. Accuracy and Stability of Numerical Algorithms, 2nd ed. SLAM, Philadelphia, PA.
34. IRONY, D., SHKLARSKI, G., AND TOLEDO, S. 2004. Parallel and fully recursive multifrontal supernodal sparse Cholesky. Fut. Generat. Comput. Syst. 20, 3, 425-440.
35. KARNI, Z. AND GOTSMAN, C. 2000. Spectral compression of mesh geometry. In Proceedings of ACM SIGGRAPH. 279-286.
36. KARYPIS, G. AND KUMAR, V. 1998. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20, 359-392.
37. KHODAKOVSKY, A., ALLIEZ, P., DESBRUN, M., AND SCHRÖDER, P. 2002. Near-optimal connectivity encoding of 2-manifold polygon meshes. Graph. Models 64, 3/4, 147-168.
38. KHODAKOVSKY, A., SCHRÖDER, P., AND SWELDENS, W. 2000. Progressive geometry compression. In Proceedings of ACM SIGGRAPH. 271-278.
39. LIPMAN, Y., SORKINE, O., COHEN-OR, D., LEVIN, D., RÖSSL, C., AND SEIDEL, H.-P. 2004. Differential coordinates for interactive mesh editing. In Proceedings of Shape Modeling International. 181-190.
40. MEIJERINK, J. A. AND VAN DER VORST H. A. 1977. An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix. Mathe. Computat. 31, 148-162.
41. PAIGE, C. C. AND SAUNDERS, M. A. 1982a. Algorithm 583 LSQR: Sparse linear equations and sparse least squares. ACM Trans. Math. Softw. 8, 195-209.
42. PAIGE, C. C. AND SAUNDERS, M. A. 1982b. LSQR. An algorithm for sparse linear equations and sparse least squares. ACM Trans. Math. Softw. 8, 43-71.
43. POTHEN, A., SIMON, H. D., AND LIOU, K.-P. 1990. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. 11, 430-452.
44. ROTKIN, V. AND TOLEDO, S. 2004. The design and implementation of a new out-of-core sparse Cholesky factorization method. ACM Trans. Math. Softw. 30, 1, 19-46.
45. SAAD, Y. 1996. Iterative Methods for Sparse Linear Systems. PWS Publishing Company.
46. SAUNDERS, M. A. 1995. Solution of sparse rectangular systems using LSQR and CRAIG. BIT 35, 588-604.
47. SORKINE, O., COHEN-OR, D., IRONY, D., AND TOLEDO, S. 2005. Geometry-aware bases for shape approximation. IEEE Trans. Visual. Comput. Graph. 11, 2, 171-180.
48. SORKINE, O., COHEN-OR, D., AND TOLEDO, S. 2003. High-pass quantization for mesh encoding. In Proceedings of the Eurographics / ACM SIGGRAPH Symposium on Geometry Processing. 42-51.
49. 1.31). In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science.
50. TOLEDO, S. 2003. TAUCS: A Library of Sparse Linear Solvers, version 2.2. Tel-Aviv University, Available at http://www.tau.ac.il/~stoledo/taucs/.
51. TOUMA, C. AND GOTSMAN, C. 1998. Triangle mesh compression. In Graphics Interface. 26-34.
52. TREFETHEN, L. N. AND BAU, III, D. 2000. Numerical Linear Algebra. SIAM, Philadelphia, PA.
53. VAIDYA, P. M. 1991. Solving linear equations with symmetric diagonally dominant matrices by constructing good preconditioners. Unpublished manuscript. Manuscript was presented at the IMA Workshop on Graph Theory and Sparse Matrix Computation, Oct., Minneapolis, MN.
54. WHALEY, R. C., PETITET, A., AND DONGARRA, J. J. 2000. Automated empirical optimization of software and the ATLAS project. Tech. rep., Computer Science Department, University Of Tennessee.