{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:58:16Z","timestamp":1725541096372},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642043185"},{"type":"electronic","value":"9783642043192"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04319-2_26","type":"book-chapter","created":{"date-parts":[[2009,11,25]],"date-time":"2009-11-25T22:09:05Z","timestamp":1259186945000},"page":"447-461","source":"Crossref","is-referenced-by-count":1,"title":["Shape Operator Metric for Surface Normal Approximation"],"prefix":"10.1007","author":[{"given":"Guillermo D.","family":"Canas","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Steven J.","family":"Gortler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Morii, F.: A Generalized K-Means Algorithm with Semi-Supervised Weight Coefficients. In: ICPR 2006: Proceedings of the 18th International Conference on Pattern Recognition, pp. 198\u2013201 (2006)","DOI":"10.1109\/ICPR.2006.70"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.aim.2003.07.017","volume":"186","author":"P.M. Gruber","year":"2004","unstructured":"Gruber, P.M.: Optimum quantization and its applications. Adv. Math.\u00a0186, 456\u2013497 (2004)","journal-title":"Adv. Math."},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Rusinkiewicz, S.: Estimating Curvatures and Their Derivatives on Triangle Meshes. In: Symposium on 3D Data Processing, Visualization, and Transmission (2004)","DOI":"10.1109\/TDPVT.2004.1335277"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF01385784","volume":"59","author":"E.F. D\u2019Azevedo","year":"1991","unstructured":"D\u2019Azevedo, E.F., Simpson, R.B.: On Optimal Triangular Meshes for Minimizing the Gradient Error. Numerische Mathematik\u00a059, 321\u2013348 (1991)","journal-title":"Numerische Mathematik"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Canas, G.D., Gortler, S.J.: On Asymptotically Optimal Meshes by Coordinate Transformation. In: 15th International Meshing Roundtable (2006)","DOI":"10.1007\/978-3-540-34958-7_17"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L.: Building Triangulations Using Epsilon-Nets. In: STOC: Proceedings of the Thirty-eighth Annual SIGACT Symposium (2006)","DOI":"10.1145\/1132516.1132564"},{"key":"26_CR7","unstructured":"Shewchuk, J.R.: What Is a Good Linear Finite Element? - Interpolation, Conditioning, Anisotropy, and Quality Measures. In: Eleventh International Meshing Roundtable, Ithaca, New York, pp. 115\u2013126 (2002)"},{"key":"26_CR8","first-page":"499","volume":"V","author":"E. Nadler","year":"1986","unstructured":"Nadler, E.: Piecewise linear best l2 approximation on triangulations. Approximation Theory\u00a0V, 499\u2013502 (1986)","journal-title":"Approximation Theory"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Garland, M., Heckbert, P.: Surface Simplification Using Quadric Error Metrics. In: ACM SIGGRAPH (1997)","DOI":"10.1145\/258734.258849"},{"issue":"1-3","key":"26_CR10","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/S0925-7721(99)00030-9","volume":"14","author":"P.S. Heckbert","year":"1999","unstructured":"Heckbert, P.S., Garland, M.: Optimal triangulation and quadric-based surface simplification. Comput. Geom. Theory Appl.\u00a014(1-3), 49\u201365 (1999)","journal-title":"Comput. Geom. Theory Appl."},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T. Gonzalez","year":"1985","unstructured":"Gonzalez, T.: Clustering to Minimize the Maximum Inter-Cluster Distance. Theoretical Computer Science\u00a038, 293\u2013306 (1985)","journal-title":"Theoretical Computer Science"},{"key":"26_CR12","unstructured":"Arthur, D., Vassilvitskii, S.: K-means++: the advantages of careful seeding. In: SODA: Symposium On Discreet Algorithms, pp. 1027\u20131035 (2007)"},{"issue":"2","key":"26_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S.P. Lloyd","year":"1982","unstructured":"Lloyd, S.P.: Least squares quantization in PCM. IEEE Transactions on Information Theory\u00a028(2), 129\u2013136 (1982)","journal-title":"IEEE Transactions on Information Theory"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Cohen-Steiner, D., Alliez, P., Desbrun, M.: Variational shape approximation. In: ACM SIGGRAPH (2004)","DOI":"10.1145\/1186562.1015817"}],"container-title":["Proceedings of the 18th International Meshing Roundtable"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04319-2_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:40:31Z","timestamp":1606185631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04319-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642043185","9783642043192"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04319-2_26","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}