{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T06:03:33Z","timestamp":1781762613007,"version":"3.54.5"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Automat Comput"],"published-print":{"date-parts":[[2007,1]]},"DOI":"10.1007\/s11633-007-0008-5","type":"journal-article","created":{"date-parts":[[2007,2,2]],"date-time":"2007-02-02T13:03:01Z","timestamp":1170421381000},"page":"8-13","source":"Crossref","is-referenced-by-count":12,"title":["Fast approximate geodesic paths on triangle mesh"],"prefix":"10.1007","volume":"4","author":[{"given":"Jie","family":"Tang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gang-Shan","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fu-Yan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ming-Min","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"8_CR1","doi-asserted-by":"crossref","first-page":"954","DOI":"10.1145\/882262.882369","volume":"22","author":"S. Katz","year":"2003","unstructured":"S. Katz, A. Tal. Hierarchical Mesh Decomposition Using Fuzzy Clustering and Cuts. ACM Transactions on Graphics. vol. 22, no. 3, pp. 954\u2013961, 2003.","journal-title":"ACM Transactions on Graphics"},{"key":"8_CR2","unstructured":"P. Sander, Z. Wood, S. Gortler, J. Snyder, H. Hoppe. Multichart Geometry Images. In Proceedings of Eurographics Symposium on Geometry Processing, Aachen, Germany, pp. 146\u2013155, 2003."},{"issue":"1","key":"8_CR3","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s11263-006-6859-3","volume":"69","author":"G. Peyre","year":"2006","unstructured":"G. Peyre, L. D. Cohen. Geodesic Remeshing Using Front Propagation. International Journal of Computer Vision, vol. 69, no. 1, pp. 145\u2013156, 2006.","journal-title":"International Journal of Computer Vision"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"M. Hilaga, Y. Shinagawa, T. Kohmura, T. L. Kunii. Topology Matching for Fully Automatic Similarity Estimation of 3d Shapes. In Proceedings of ACM SIGGRAPH 2001, Los Angeles, USA, pp. 203\u2013212, 2001.","DOI":"10.1145\/383259.383282"},{"key":"8_CR5","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/978-3-7091-6803-5_17","volume-title":"Data Visualization","author":"K. Polthier","year":"1999","unstructured":"K. Polthier, M. Schmies. Geodesic Flow on Polyhedral Surfaces. Data Visualization, Springer, Vienna, pp. 179\u2013188, 1999."},{"issue":"4","key":"8_CR6","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1137\/0216045","volume":"16","author":"J. Mitchell","year":"1987","unstructured":"J. Mitchell, D. M. Mount, C. H. Papadimitriou. The Discrete Geodesic Problem. SIAM Journal of Computing, vol. 16, no. 4, pp. 647\u2013668, 1987.","journal-title":"SIAM Journal of Computing"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"V. Surazhsky, T. Surazhsky, D. Kirsanov, S. Gortler, H. Hoppe. Fast Exact and Approximate Geodesics on Meshes. In Proceedings of ACM SIGGRAPH 2005, Los Angeles, USA, pp. 553\u2013560, 2005.","DOI":"10.1145\/1186822.1073228"},{"issue":"2","key":"8_CR8","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1142\/S0218195996000095","volume":"6","author":"J. Chen","year":"1996","unstructured":"J. Chen, Y. Han. Shortest Paths on a Polyhedron, Part I: Computing Shortest Paths. International Journal of Computational Geometry & Applications, vol. 6, no. 2, pp. 127\u2013144, 1996.","journal-title":"International Journal of Computational Geometry & Applications"},{"key":"8_CR9","unstructured":"B. Kaneva, J. O\u2019Rourke. An Implementation of Chen & Han\u2019s Shortest Paths Algorithm. In Proceedings of the 12th Canadian Conference on Computational Geometry, New Brunswick, Germany, pp. 139\u2013146, 2000."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"S. Kapoor. Efficient Computation of Geodesic Shortest Paths. In Proceedings of the Thirty-first Annual ACM Symposium on Theory of Computing, Atlanta, Georgia, USA, pp. 770\u2013779, 1999.","DOI":"10.1145\/301250.301449"},{"issue":"11","key":"8_CR11","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1016\/S0010-4485(01)00097-5","volume":"33","author":"T. Kanai","year":"2001","unstructured":"T. Kanai, H. Suzuki. Approximate Shortest Path on a Polyhedral Surface and Its Applications. Computer-Aided Design, vol. 33, no. 11, pp. 801\u2013811, 2001.","journal-title":"Computer-Aided Design"},{"issue":"5","key":"8_CR12","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1016\/j.cag.2005.08.003","volume":"29","author":"D. Martinez","year":"2005","unstructured":"Dimas Martinez, Luiz Velho, Paulo C. Carvalho. Computing Geodesics on Triangular Meshes. Computers & Graphics, vol. 29, no. 5, pp. 667\u2013675, 2005.","journal-title":"Computers & Graphics"},{"key":"8_CR13","unstructured":"M. Novotni, R. Klein. Computing Geodesic Distances on Triangular Meshes. In Proceedings of the 10th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision, Bonn, Germany, pp. 341\u2013347, 2002."},{"issue":"15","key":"8_CR14","doi-asserted-by":"crossref","first-page":"8431","DOI":"10.1073\/pnas.95.15.8431","volume":"95","author":"R. Kimmel","year":"1998","unstructured":"R. Kimmel, J. Sethian. Computing Geodesic Paths on Manifolds. Proceedings of the National Academy of Sciences of USA, vol. 95, no. 15, pp. 8431\u20138435, 1998.","journal-title":"Proceedings of the National Academy of Sciences of USA"}],"container-title":["International Journal of Automation and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11633-007-0008-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11633-007-0008-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11633-007-0008-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:46:33Z","timestamp":1559400393000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11633-007-0008-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,1]]}},"alternative-id":["8"],"URL":"https:\/\/doi.org\/10.1007\/s11633-007-0008-5","relation":{},"ISSN":["1476-8186","1751-8520"],"issn-type":[{"value":"1476-8186","type":"print"},{"value":"1751-8520","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,1]]}}}