{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T04:13:49Z","timestamp":1781928829168,"version":"3.54.5"},"reference-count":21,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer-Aided Design"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1016\/s0010-4485(01)00097-5","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T14:29:16Z","timestamp":1034605756000},"page":"801-811","source":"Crossref","is-referenced-by-count":52,"title":["Approximate shortest path on a polyhedral surface and its applications"],"prefix":"10.1016","volume":"33","author":[{"given":"Takashi","family":"Kanai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hiromasa","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0010-4485(01)00097-5_BIB1","doi-asserted-by":"crossref","unstructured":"Curless B, Levoy M. A volumetric method for building complex models from range images. In: Computer Graphics (Proc SIGGRAPH 96), 1996. p. 303\u201312.","DOI":"10.1145\/237170.237269"},{"issue":"4","key":"10.1016\/S0010-4485(01)00097-5_BIB2","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1137\/0216045","article-title":"The discrete geodesic problem","volume":"16","author":"Mitchell","year":"1987","journal-title":"SIAM J Computing"},{"key":"10.1016\/S0010-4485(01)00097-5_BIB3","doi-asserted-by":"crossref","unstructured":"Chen J, Han Y. Shortest paths on a polyhedron. In: Proc Sixth ACM Symposium on Computational Geometry, 1990. p. 360\u201369.","DOI":"10.1145\/98524.98601"},{"key":"10.1016\/S0010-4485(01)00097-5_BIB4","doi-asserted-by":"crossref","unstructured":"Lanthier MA, Maheshwari A, Sack J-R. Approximating weighted shortest paths on polyhedral surfraces. In: Proc 13th ACM Symposium on Computational Geometry, 1997. p. 274\u201383.","DOI":"10.1145\/262839.262984"},{"key":"10.1016\/S0010-4485(01)00097-5_BIB5","doi-asserted-by":"crossref","unstructured":"Mata CS, Mitchell JSB. A new algorithm for computing shortest paths in weighted planar subdivisions. In: Proc 13th ACM Symposium on Computational Geometry, 1997. p. 265\u201373.","DOI":"10.1145\/262839.262983"},{"key":"10.1016\/S0010-4485(01)00097-5_BIB6","series-title":"The handbook of computational geometry","article-title":"Geometric shortest paths and network optimization","author":"Mitchell","year":"2000"},{"key":"10.1016\/S0010-4485(01)00097-5_BIB7","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1137\/0215014","article-title":"On shortest paths in polyhedral spaces","volume":"15","author":"Sharir","year":"1986","journal-title":"SIAM J Computing"},{"key":"10.1016\/S0010-4485(01)00097-5_BIB8","doi-asserted-by":"crossref","unstructured":"Har-Peled S. Approximate shortest paths and geodesic diameters on convex polytopes in three dimensions. In Proc 13th ACM Symposium on Computational Geometry, 1997. p. 359\u201366.","DOI":"10.1145\/262839.263003"},{"key":"10.1016\/S0010-4485(01)00097-5_BIB9","doi-asserted-by":"crossref","unstructured":"Varadarajan KR, Agarwal PK. Approximating shortest paths on a nonconvex polyhedron. In: Proc 38th Annual Symposium on Foundations of Computer Science, 1997. p. 182\u201393.","DOI":"10.1109\/SFCS.1997.646107"},{"issue":"2","key":"10.1016\/S0010-4485(01)00097-5_BIB10","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/0022-0000(89)90041-X","article-title":"Optimal shortest path queries in a simple polygon","volume":"39","author":"Guibas","year":"1989","journal-title":"J Computer and System Sciences"},{"key":"10.1016\/S0010-4485(01)00097-5_BIB11","series-title":"Data structures and algorithms","author":"Aho","year":"1983"},{"key":"10.1016\/S0010-4485(01)00097-5_BIB12","doi-asserted-by":"crossref","unstructured":"Garland M, Heckbert PS. Surface simplification using quadric error metrics. In: Computer Graphics (Proc SIGGRAPH 97), 1997. p. 209\u201316.","DOI":"10.1145\/258734.258849"},{"key":"10.1016\/S0010-4485(01)00097-5_BIB13","doi-asserted-by":"crossref","unstructured":"Maillot J, Yahia H, Verroust A. Interactive texture mapping. In: Computer Graphics (Proc SIGGRAPH 93), 1993. p. 27\u201334.","DOI":"10.1145\/166117.166120"},{"key":"10.1016\/S0010-4485(01)00097-5_BIB14","doi-asserted-by":"crossref","unstructured":"Krishnamurthy V, Levoy M. Fitting smooth surfaces to dense polygon meshes. In: Computer Graphics (Proc SIGGRAPH 96), 1996. p. 313\u201324.","DOI":"10.1145\/237170.237270"},{"key":"10.1016\/S0010-4485(01)00097-5_BIB15","doi-asserted-by":"crossref","unstructured":"Lee AWF, Sweldens W, Schr\u00f6der P, Cowsar L, Dobkin D. MAPS: multiresolution adaptive parameterization of surfaces. In: Computer Graphics (Proc SIGGRAPH 98), 1998. p. 95\u2013104.","DOI":"10.1145\/280814.280828"},{"key":"10.1016\/S0010-4485(01)00097-5_BIB16","unstructured":"Kuriyama S, Kaneko T. Discrete parameterization for deforming arbitrary meshes. In: Proc Graphics Interface \u201999, 1999. p. 132\u20139."},{"issue":"3","key":"10.1016\/S0010-4485(01)00097-5_BIB17","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1111\/1467-8659.00329","article-title":"Interactive multiresolution editing of arbitrary meshes","volume":"18","author":"Lee","year":"1999","journal-title":"Computer Graphics Forum (Eurographics 99)"},{"issue":"2","key":"10.1016\/S0010-4485(01)00097-5_BIB18","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/38.824544","article-title":"Metamorphosis of arbitrary triangular meshes","volume":"20","author":"Kanai","year":"2000","journal-title":"IEEE Computer Graphics and Applications"},{"key":"10.1016\/S0010-4485(01)00097-5_BIB19","unstructured":"Kanai T, Suzuki H, Mitani J, Kimura F. Interactive mesh fusion based on local 3D metamorphosis. In: Proc Graphics Interface. \u201999, 1999. p. 148\u201356."},{"key":"10.1016\/S0010-4485(01)00097-5_BIB20","doi-asserted-by":"crossref","unstructured":"Thorup M. Undirected single source shortest paths in linear time. In: Proc 38th Symposium on Foundations of Computer Science, 1997. p. 12\u201321.","DOI":"10.1109\/SFCS.1997.646088"},{"key":"10.1016\/S0010-4485(01)00097-5_BIB21","series-title":"Artificial intelligence","author":"Rich","year":"1983"}],"container-title":["Computer-Aided Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0010448501000975?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0010448501000975?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T02:49:38Z","timestamp":1578451778000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0010448501000975"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":21,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0010448501000975"],"URL":"https:\/\/doi.org\/10.1016\/s0010-4485(01)00097-5","relation":{},"ISSN":["0010-4485"],"issn-type":[{"value":"0010-4485","type":"print"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}