{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T20:56:10Z","timestamp":1761512170566,"version":"3.41.0"},"reference-count":53,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2005,10,1]],"date-time":"2005-10-01T00:00:00Z","timestamp":1128124800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2005,10]]},"abstract":"<jats:p>\n            This article presents an algebraic analysis of a mesh-compression technique called\n            <jats:italic>high-pass quantization<\/jats:italic>\n            [Sorkine et al. 2003]. In high-pass quantization, a rectangular matrix based on the mesh topological Laplacian is applied to the vectors of the Cartesian coordinates of a polygonal mesh. The resulting vectors, called \u03b4-coordinates, are then quantized. The applied matrix is a function of the topology of the mesh and the indices of a small set of mesh vertices (anchors) but not of the location of the vertices. An approximation of the geometry can be reconstructed from the quantized \u03b4-coordinates and the spatial locations of the anchors. In this article, we show how to algebraically bound the reconstruction error that this method generates. We show that the small singular value of the transformation matrix can be used to bound both the quantization error and the rounding error which is due to the use of floating-point arithmetic. Furthermore, we prove a bound on this singular value. The bound is a function of the topology of the mesh and of the selected anchors. We also propose a new anchor-selection algorithm, inspired by this bound. We show experimentally that the method is effective and that the computed upper bound on the error is not too pessimistic.\n          <\/jats:p>","DOI":"10.1145\/1095878.1095880","type":"journal-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T16:00:45Z","timestamp":1131379245000},"page":"1259-1282","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Algebraic analysis of high-pass quantization"],"prefix":"10.1145","volume":"24","author":[{"given":"Doron","family":"Chen","sequence":"first","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Cohen-Or","sequence":"additional","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olga","family":"Sorkine","sequence":"additional","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sivan","family":"Toledo","sequence":"additional","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,10]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"480","article-title":"Valence-driven connectivity encoding for 3D meshes","volume":"20","author":"Alliez P.","year":"2001","unstructured":"Alliez , P. and Desbrun , M. 2001 . Valence-driven connectivity encoding for 3D meshes . Comput. Graph. For. 20 , 3, 480 -- 489 . Alliez, P. and Desbrun, M. 2001. Valence-driven connectivity encoding for 3D meshes. Comput. Graph. For. 20, 3, 480--489.","journal-title":"Comput. Graph. For."},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"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.  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.","DOI":"10.1007\/3-540-26808-1_1"},{"volume-title":"Iterative Solution Methods","author":"Axelsson O.","key":"e_1_2_1_3_1","unstructured":"Axelsson , O. 1994. Iterative Solution Methods . Cambridge University Press , Cambridge, UK . Axelsson, O. 1994. Iterative Solution Methods. Cambridge University Press, Cambridge, UK."},{"volume-title":"Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods","author":"Barret R.","key":"e_1_2_1_4_1","unstructured":"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 . 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."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1037957.1037961"},{"key":"e_1_2_1_6_1","unstructured":"Bern M. Gilbert J. R. Hendrickson B. Nguyen N. and Toledo S. 2001. Support-graph preconditioners. SIAM J. Matrix Anal. Appl. Submitted for publication. 10.1137\/S0895479801384019   Bern M. Gilbert J. R. Hendrickson B. Nguyen N. and Toledo S. 2001. Support-graph preconditioners. SIAM J. Matrix Anal. Appl. Submitted for publication. 10.1137\/S0895479801384019"},{"volume-title":"Numerical Methods for Least Squares Problems","author":"Bj\u00f6rck","key":"e_1_2_1_7_1","unstructured":"Bj\u00f6rck , \u00c5. 1996. Numerical Methods for Least Squares Problems . SIAM , Philadelphia, PA . Bj\u00f6rck, \u00c5. 1996. Numerical Methods for Least Squares Problems. SIAM, Philadelphia, PA."},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01930845","article-title":"Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations","volume":"19","author":"Bj\u00f6rck","year":"1979","unstructured":"Bj\u00f6rck , \u00c5. and Elfving, T. 1979 . Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations . BIT 19 , 145 -- 163 . Bj\u00f6rck, \u00c5. and Elfving, T. 1979. Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations. BIT 19, 145--163.","journal-title":"BIT"},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1002\/nla.343","article-title":"Maximum-weight-basis preconditioners","volume":"11","author":"Boman E. G.","year":"2004","unstructured":"Boman , E. G. , Chen , D. , Hendrickson , B. , and Toledo , S. 2004 . Maximum-weight-basis preconditioners . Numer. Linear Algeb. Appl. 11 , 695 -- 721 . Boman, E. G., Chen, D., Hendrickson, B., and Toledo, S. 2004. Maximum-weight-basis preconditioners. Numer. Linear Algeb. Appl. 11, 695--721.","journal-title":"Numer. Linear Algeb. Appl."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479801390637"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479801385037"},{"key":"e_1_2_1_12_1","unstructured":"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.  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."},{"key":"e_1_2_1_13_1","volume-title":"A Multigrid Tutorial","author":"Briggs W. L.","unstructured":"Briggs , W. L. , Henson , V. E. , and McCormick , S. F. 2000. A Multigrid Tutorial , 2 nd Ed. SIAM , Philadelphia, PA . Briggs, W. L., Henson, V. E., and McCormick, S. F. 2000. A Multigrid Tutorial, 2nd Ed. SIAM, Philadelphia, PA.","edition":"2"},{"key":"e_1_2_1_14_1","first-page":"30","article-title":"Vaidya's preconditioners: Implementation and experimental study","volume":"16","author":"Chen D.","year":"2003","unstructured":"Chen , D. and Toledo , S. 2003 . Vaidya's preconditioners: Implementation and experimental study . Electr. Trans. Numer. Anal. 16 , 30 -- 49 . Chen, D. and Toledo, S. 2003. Vaidya's preconditioners: Implementation and experimental study. Electr. Trans. Numer. Anal. 16, 30--49.","journal-title":"Electr. Trans. Numer. Anal."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2002.1044522"},{"volume-title":"Spectral Graph Theory","author":"Chung F. R. K.","key":"e_1_2_1_16_1","unstructured":"Chung , F. R. K. 1997. Spectral Graph Theory . American Methematical Society . Chung, F. R. K. 1997. Spectral Graph Theory. American Methematical Society."},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1002\/sapm195534164","article-title":"The n-step iteration procedure","volume":"34","author":"Craig E. J.","year":"1955","unstructured":"Craig , E. J. 1955 . The n-step iteration procedure . J. Math. Phys. 34 , 65 -- 73 . Craig, E. J. 1955. The n-step iteration procedure. J. Math. Phys. 34, 65--73.","journal-title":"J. Math. Phys."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1024074.1024079"},{"volume-title":"On the conjugate gradient method for solving linear least squares problems. Tech. rep. LiTH-MAT-R-78-3","author":"Elfving T.","key":"e_1_2_1_19_1","unstructured":"Elfving , T. 1978. On the conjugate gradient method for solving linear least squares problems. Tech. rep. LiTH-MAT-R-78-3 , Link\u00f6ping University , Sweden . Elfving, T. 1978. On the conjugate gradient method for solving linear least squares problems. Tech. rep. LiTH-MAT-R-78-3, Link\u00f6ping University, Sweden."},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","article-title":"Algebraic connectivity of graphs","volume":"23","author":"Fiedler M.","year":"1973","unstructured":"Fiedler , M. 1973 . Algebraic connectivity of graphs . Czech. Math. J. 23 , 298 -- 305 . Fiedler, M. 1973. Algebraic connectivity of graphs. Czech. Math. J. 23, 298--305.","journal-title":"Czech. Math. J."},{"key":"e_1_2_1_21_1","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0024-3795(80)90159-7","article-title":"Solution of sparse linear least squares problems using Givens rotations","volume":"34","author":"George J. A.","year":"1980","unstructured":"George , J. A. and Heath , M. T. 1980 . Solution of sparse linear least squares problems using Givens rotations . Linear Algeb. Appl. 34 , 69 -- 83 . George, J. A. and Heath, M. T. 1980. Solution of sparse linear least squares problems using Givens rotations. Linear Algeb. Appl. 34, 69--83.","journal-title":"Linear Algeb. Appl."},{"key":"e_1_2_1_22_1","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1137\/0720022","article-title":"On row and column orderings for sparse least squares problems","volume":"20","author":"George J. A.","year":"1983","unstructured":"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 . 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.","journal-title":"SIAM J. Numer. Anal."},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1137\/0907031","article-title":"Orthogonal reduction of sparse matrices to upper triangular form using Householder transformations","volume":"7","author":"George J. A.","year":"1986","unstructured":"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 . 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.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"e_1_2_1_24_1","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1137\/0909057","article-title":"On the complexity of sparse QR and LU factorization of finite-element matrices","volume":"9","author":"George J. A.","year":"1988","unstructured":"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 . 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.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"e_1_2_1_25_1","unstructured":"Golub G. H. and Loan C. F. V. 1996. Matrix Computations 3rd Ed. Johns Hopkins University Press.   Golub G. H. and Loan C. F. V. 1996. Matrix Computations 3rd Ed. Johns Hopkins University Press."},{"volume-title":"IEEE 9th International Parallel Processing Symposium","author":"Gremban K.","key":"e_1_2_1_26_1","unstructured":"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. 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."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479897329825"},{"volume-title":"New bounds on the encoding of planar triangulations. Technical rep. WSI--2000--1, (Jan","author":"Gumhold S.","key":"e_1_2_1_29_1","unstructured":"Gumhold , S. 2000. New bounds on the encoding of planar triangulations. Technical rep. WSI--2000--1, (Jan .) Wilhelm-Schickard-Institut f\u00fcr Informatik, University of T\u00fcbingen , Germany. Gumhold, S. 2000. New bounds on the encoding of planar triangulations. Technical rep. WSI--2000--1, (Jan.) Wilhelm-Schickard-Institut f\u00fcr Informatik, University of T\u00fcbingen, Germany."},{"volume-title":"Proceedings of ACM SIGGRAPH. 95--102","author":"Guskov I.","key":"e_1_2_1_30_1","unstructured":"Guskov , I. , Vidim\u010de , K. , Sweldens , W. , and Schr\u00f6der , P . 2000. Normal meshes . In Proceedings of ACM SIGGRAPH. 95--102 . 10.1145\/344779.344831 Guskov, I., Vidim\u010de, K., Sweldens, W., and Schr\u00f6der, P. 2000. Normal meshes. In Proceedings of ACM SIGGRAPH. 95--102. 10.1145\/344779.344831"},{"key":"e_1_2_1_31_1","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/BF01931691","article-title":"A class of first-order factorization methods","volume":"18","author":"Gustafsson I.","year":"1978","unstructured":"Gustafsson , I. 1978 . A class of first-order factorization methods . BIT 18 , 142 -- 156 . Gustafsson, I. 1978. A class of first-order factorization methods. BIT 18, 142--156.","journal-title":"BIT"},{"key":"e_1_2_1_32_1","unstructured":"Heggernes P. and Matstoms P. 1996. Finding good column orderings for sparse QR factorizations. Tech. rep. LiTH-MAT-1996-20 Department of Mathematics Link\u00f6ping University Sweden.  Heggernes P. and Matstoms P. 1996. Finding good column orderings for sparse QR factorizations. Tech. rep. LiTH-MAT-1996-20 Department of Mathematics Link\u00f6ping University Sweden."},{"key":"e_1_2_1_33_1","volume-title":"Accuracy and Stability of Numerical Algorithms","author":"Higham N. J.","unstructured":"Higham , N. J. 2002. Accuracy and Stability of Numerical Algorithms , 2 nd ed. SIAM, Philadelphia , PA. Higham, N. J. 2002. Accuracy and Stability of Numerical Algorithms, 2nd ed. SIAM, Philadelphia, PA.","edition":"2"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2003.07.007"},{"volume-title":"Proceedings of ACM SIGGRAPH. 279--286","author":"Karni Z.","key":"e_1_2_1_35_1","unstructured":"Karni , Z. and Gotsman , C . 2000. Spectral compression of mesh geometry . In Proceedings of ACM SIGGRAPH. 279--286 . 10.1145\/344779.344924 Karni, Z. and Gotsman, C. 2000. Spectral compression of mesh geometry. In Proceedings of ACM SIGGRAPH. 279--286. 10.1145\/344779.344924"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Khodakovsky A. Alliez P. Desbrun M. and Schr\u00f6der P. 2002. Near-optimal connectivity encoding of 2-manifold polygon meshes. Graph. Models 64 3\/4 147--168. 10.1006\/gmod.2002.0575   Khodakovsky A. Alliez P. Desbrun M. and Schr\u00f6der P. 2002. Near-optimal connectivity encoding of 2-manifold polygon meshes. Graph. Models 64 3\/4 147--168. 10.1006\/gmod.2002.0575","DOI":"10.1006\/gmod.2002.0575"},{"volume-title":"Proceedings of ACM SIGGRAPH. 271--278","author":"Khodakovsky A.","key":"e_1_2_1_38_1","unstructured":"Khodakovsky , A. , Schr\u00f6der , P. , and Sweldens , W . 2000. Progressive geometry compression . In Proceedings of ACM SIGGRAPH. 271--278 . 10.1145\/344779.344922 Khodakovsky, A., Schr\u00f6der, P., and Sweldens, W. 2000. Progressive geometry compression. In Proceedings of ACM SIGGRAPH. 271--278. 10.1145\/344779.344922"},{"key":"e_1_2_1_39_1","volume-title":"Proceedings of Shape Modeling International. 181--190","author":"Lipman Y.","year":"2004","unstructured":"Lipman , Y. , Sorkine , O. , Cohen-Or , D. , Levin , D. , R\u00f6ssl , C. , and Seidel , H . -P. 2004. Differential coordinates for interactive mesh editing . In Proceedings of Shape Modeling International. 181--190 . 10.1109\/SMI. 2004 .30 Lipman, Y., Sorkine, O., Cohen-Or, D., Levin, D., R\u00f6ssl, C., and Seidel, H.-P. 2004. Differential coordinates for interactive mesh editing. In Proceedings of Shape Modeling International. 181--190. 10.1109\/SMI.2004.30"},{"key":"e_1_2_1_40_1","first-page":"148","article-title":"An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix. Mathe","volume":"31","author":"Meijerink J. A.","year":"1977","unstructured":"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 . 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.","journal-title":"Computat."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/355993.356000"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/355984.355989"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/0611030"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/974781.974783"},{"volume-title":"Iterative Methods for Sparse Linear Systems","author":"Saad Y.","key":"e_1_2_1_45_1","unstructured":"Saad , Y. 1996. Iterative Methods for Sparse Linear Systems . PWS Publishing Company . Saad, Y. 1996. Iterative Methods for Sparse Linear Systems. PWS Publishing Company."},{"key":"e_1_2_1_46_1","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1007\/BF01739829","article-title":"Solution of sparse rectangular systems using LSQR and CRAIG","volume":"35","author":"Saunders M. A.","year":"1995","unstructured":"Saunders , M. A. 1995 . Solution of sparse rectangular systems using LSQR and CRAIG . BIT 35 , 588 -- 604 . Saunders, M. A. 1995. Solution of sparse rectangular systems using LSQR and CRAIG. BIT 35, 588--604.","journal-title":"BIT"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2005.33"},{"volume-title":"Proceedings of the Eurographics\/ACM SIGGRAPH Symposium on Geometry Processing. 42--51","author":"Sorkine O.","key":"e_1_2_1_48_1","unstructured":"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 . 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."},{"volume-title":"Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science.","author":"Spielman D.","key":"e_1_2_1_49_1","unstructured":"Spielman , D. and Teng , S . -H. 2003. Solving sparse, symmetric, diagonally-dominant linear systems in time o(m1.31) . In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science. Spielman, D. and Teng, S.-H. 2003. Solving sparse, symmetric, diagonally-dominant linear systems in time o(m1.31). In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science."},{"key":"e_1_2_1_50_1","volume-title":"Taucs: A Library of Sparse Linear Solvers, version 2.2","author":"Toledo S.","year":"2003","unstructured":"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\/. 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\/."},{"key":"e_1_2_1_51_1","unstructured":"Touma C. and Gotsman C. 1998. Triangle mesh compression. In Graphics Interface. 26--34.  Touma C. and Gotsman C. 1998. Triangle mesh compression. In Graphics Interface. 26--34."},{"key":"e_1_2_1_52_1","volume-title":"D","author":"Trefethen L. N.","year":"2000","unstructured":"Trefethen , L. N. and Bau , III , D . 2000 . Numerical Linear Algebra. SIAM , Philadelphia, PA. Trefethen, L. N. and Bau, III, D. 2000. Numerical Linear Algebra. SIAM, Philadelphia, PA."},{"key":"e_1_2_1_53_1","unstructured":"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.  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."},{"key":"e_1_2_1_54_1","unstructured":"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.   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."}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1095878.1095880","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1095878.1095880","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:28Z","timestamp":1750262908000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1095878.1095880"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10]]},"references-count":53,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,10]]}},"alternative-id":["10.1145\/1095878.1095880"],"URL":"https:\/\/doi.org\/10.1145\/1095878.1095880","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"type":"print","value":"0730-0301"},{"type":"electronic","value":"1557-7368"}],"subject":[],"published":{"date-parts":[[2005,10]]},"assertion":[{"value":"2005-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}