{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T00:07:20Z","timestamp":1718842040479},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,5,17]],"date-time":"2011-05-17T00:00:00Z","timestamp":1305590400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Vis Comput"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s00371-011-0600-0","type":"journal-article","created":{"date-parts":[[2011,5,16]],"date-time":"2011-05-16T16:07:42Z","timestamp":1305562062000},"page":"63-74","source":"Crossref","is-referenced-by-count":3,"title":["Approximate straightest path computation and its application in parameterization"],"prefix":"10.1007","volume":"28","author":[{"given":"Zhong","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yao","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaogang","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lizhuang","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,5,17]]},"reference":[{"key":"600_CR1","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1145\/1653771.1653804","volume-title":"Proceedings of the 17th ACM SIGSPATIAL Conference on Advances in Geographic Information Systems","author":"V. Verma","year":"2009","unstructured":"Verma, V., Snoeyink, J.: Reducing the memory required to find a geodesic shortest path on a large mesh. In: Proceedings of the 17th ACM SIGSPATIAL Conference on Advances in Geographic Information Systems, pp. 227\u2013235 (2009)"},{"key":"600_CR2","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/3-7643-7384-9_18","volume":"63","author":"G. Peyre","year":"2005","unstructured":"Peyre, G., Cohen, L.: Geodesic computations for fast and accurate surface remeshing and parameterization. Prog. Nonlinear Differ. Equ. Appl. 63, 157\u2013171 (2005)","journal-title":"Prog. Nonlinear Differ. Equ. Appl."},{"issue":"1","key":"600_CR3","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/MMUL.2005.5","volume":"12","author":"H. Lee","year":"2005","unstructured":"Lee, H., Tong, Y., Desbrun, M.: Geodesics-based one-to-one parameterization of 3D triangle meshes. IEEE Multimed. 12(1), 27\u201333 (2005)","journal-title":"IEEE Multimed."},{"key":"600_CR4","first-page":"366","volume-title":"Mathematical Visualization","author":"K. Polthier","year":"1998","unstructured":"Polthier, K., Schmies, M.: Straightest geodesics on polyhedral surfaces. In: Mathematical Visualization, pp. 366\u2013382. Springer, Berlin (1998)"},{"key":"600_CR5","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/11802914_47","volume-title":"Proceedings of Geometric Modeling and Processing","author":"S. Lee","year":"2006","unstructured":"Lee, S., Han, J., Lee, H.: Straightest paths on meshes by cutting planes. In: Proceedings of Geometric Modeling and Processing. LNCS, vol. 4077, pp. 609\u2013615 (2006)"},{"key":"600_CR6","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1561\/0600000011","volume":"2","author":"A. Sheffer","year":"2006","unstructured":"Sheffer, A., Praun, E., Rose, K.: Mesh parameterization methods and their applications. Comput. Graph. Vis. 2, 105\u2013171 (2006)","journal-title":"Comput. Graph. Vis."},{"key":"600_CR7","first-page":"409","volume-title":"Proceedings of ACM SIGGRAPH","author":"P. Sander","year":"2001","unstructured":"Sander, P., Snyder, J., Gortler, S., et al.: Texture mapping progressive meshes. In: Proceedings of ACM SIGGRAPH, pp. 409\u2013416 (2001)"},{"key":"600_CR8","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1145\/1201775.882274","volume-title":"Proceedings of ACM SIGGRAPH","author":"E. Praun","year":"2003","unstructured":"Praun, E., Hoppe, H.: Spherical parameterization and remeshing. In: Proceedings of ACM SIGGRAPH, pp. 340\u2013349 (2003)"},{"issue":"3","key":"600_CR9","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1016\/j.cag.2009.03.024","volume":"33","author":"Y. He","year":"2009","unstructured":"He, Y., Wang, H., Fu, C., et al.: A divide-and-conquer approach for automatic polycube map construction. Comput. Graph. 33(3), 369\u2013380 (2009)","journal-title":"Comput. Graph."},{"key":"600_CR10","first-page":"173","volume-title":"Proceedings of ACM SIGGRAPH","author":"M. Eck","year":"1995","unstructured":"Eck, M., Derose, T., Duchamp, T., et al.: Multiresolution analysis of arbitrary meshes. In: Proceedings of ACM SIGGRAPH, pp.\u00a0173\u2013182 (1995)"},{"key":"600_CR11","first-page":"209","volume-title":"Proceedings of Eurographics","author":"M. Desbrun","year":"2002","unstructured":"Desbrun, M., Meyer, M., Alliez, P.: Intrinsic parameterizations of surface meshes. In: Proceedings of Eurographics, pp. 209\u2013218 (2002)"},{"issue":"3","key":"600_CR12","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0167-8396(96)00031-3","volume":"14","author":"M. Floater","year":"1997","unstructured":"Floater, M.: Parameterization and smooth approximation of surface triangulations. Comput. Aided Geom. Des. 14(3), 231\u2013250 (1997)","journal-title":"Comput. Aided Geom. Des."},{"issue":"1","key":"600_CR13","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/S0167-8396(03)00002-5","volume":"20","author":"M. Floater","year":"2003","unstructured":"Floater, M.: Mean value coordinates. Comput. Aided Geom. Des. 20(1), 19\u201327 (2003)","journal-title":"Comput. Aided Geom. Des."},{"issue":"5","key":"600_CR14","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1016\/S0097-8493(02)00123-1","volume":"26","author":"Y. Lee","year":"2002","unstructured":"Lee, Y., Kim, H.S., Lee, S.: Mesh parameterization with a virtual boundary. Comput. Graph. 26(5), 677\u2013686 (2002)","journal-title":"Comput. Graph."},{"issue":"4","key":"600_CR15","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1137\/0216045","volume":"16","author":"J. Mitchell","year":"1987","unstructured":"Mitchell, J., Mount, D., Papadimitriou, C.: The discrete geodesic problem. SIAM J. Comput. 16(4), 647\u2013668 (1987)","journal-title":"SIAM J. Comput."},{"key":"600_CR16","first-page":"360","volume-title":"Proceedings of 6th Symposium on Computational Geometry","author":"J. Chen","year":"1990","unstructured":"Chen, J., Han, Y.: Shortest paths on a polyhedron. In: Proceedings of 6th Symposium on Computational Geometry, pp. 360\u2013369 (1990)"},{"key":"600_CR17","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1145\/1186822.1073228","volume-title":"Proceedings of ACM SIGGRAPH","author":"V. Surazhsky","year":"2005","unstructured":"Surazhsky, V., Surazhsky, T., Kirsanov, D., et al.: Fast exact and approximate geodesics on meshes. In: Proceedings of ACM SIGGRAPH, pp. 553\u2013560 (2005)"},{"issue":"4","key":"600_CR18","first-page":"107","volume":"28","author":"S. Xin","year":"2009","unstructured":"Xin, S., Wang, G.: Improving Chen & Han\u2019s algorithm on the discrete geodesic problem. ACM Trans. Graph. 28(4), 107 (2009)","journal-title":"ACM Trans. Graph."},{"issue":"11","key":"600_CR19","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1016\/S0010-4485(01)00097-5","volume":"33","author":"T. Kanai","year":"2001","unstructured":"Kanai, T., Suzuki, H.: Approximate shortest path on a polyhedral surface and its applications. Comput. Aided Des. 33(11), 801\u2013811 (2001)","journal-title":"Comput. Aided Des."},{"issue":"15","key":"600_CR20","doi-asserted-by":"crossref","first-page":"8431","DOI":"10.1073\/pnas.95.15.8431","volume":"95","author":"R. Kimmel","year":"1998","unstructured":"Kimmel, R., Sethian, J.: Computing geodesic paths on manifolds. Proc. Natl. Acad. Sci. USA 95(15), 8431\u20138435 (1998)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"600_CR21","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1109\/SMI.2004.1314507","volume-title":"Proceedings of Shape Modeling International","author":"S. Yoshizawa","year":"2004","unstructured":"Yoshizawa, S., Belyaev, A., Seidel, H.: A fast and simple stretch-minimizing mesh parameterization. In: Proceedings of Shape Modeling International, pp. 200\u2013208 (2004)"},{"key":"600_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1508044.1508091","volume-title":"ACM SIGGRAPH Asian 2008 Course Notes","author":"K. Hormann","year":"2008","unstructured":"Hormann, K., Polthier, K., Sheffer, A. Mesh parameterization: theory and practice. In: ACM SIGGRAPH Asian 2008 Course Notes, pp. 1\u201381 (2008)"},{"issue":"5","key":"600_CR23","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1111\/j.1467-8659.2008.01290.x","volume":"27","author":"L. Liu","year":"2008","unstructured":"Liu, L., Zhang, L., Xu, Y., Gotsman, C., Gortler, S.: A local\/global approach to mesh parameterization. Comput. Graph. Forum 27(5), 1495\u20131504 (2008)","journal-title":"Comput. Graph. Forum"},{"issue":"2","key":"600_CR24","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1111\/j.1467-8659.2008.01142.x","volume":"27","author":"M. Ben-Chen","year":"2008","unstructured":"Ben-Chen, M., Gotsman, C., Bunin, G.: Conformal flattening by curvature prescription and metric scaling. Comput. Graph. Forum 27(2), 449\u2013458 (2008)","journal-title":"Comput. Graph. Forum"},{"issue":"3","key":"600_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1360612.1360676","volume":"27","author":"B. Springborn","year":"2008","unstructured":"Springborn, B., Schroder, P., Pinkall, U.: Conformal equivalence of triangle meshes. ACM Trans. Graph. 27(3), 1\u201311 (2008)","journal-title":"ACM Trans. Graph."}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-011-0600-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00371-011-0600-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-011-0600-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,6]],"date-time":"2023-06-06T19:43:13Z","timestamp":1686080593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00371-011-0600-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,17]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["600"],"URL":"https:\/\/doi.org\/10.1007\/s00371-011-0600-0","relation":{},"ISSN":["0178-2789","1432-2315"],"issn-type":[{"value":"0178-2789","type":"print"},{"value":"1432-2315","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,17]]}}}