{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T20:40:23Z","timestamp":1762116023413,"version":"build-2065373602"},"reference-count":45,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61332015","61572021","61772016","61772312","61772318"],"award-info":[{"award-number":["61332015","61572021","61772016","61772312","61772318"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer-Aided Design"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1016\/j.cad.2018.04.021","type":"journal-article","created":{"date-parts":[[2018,5,16]],"date-time":"2018-05-16T11:57:32Z","timestamp":1526471852000},"page":"128-138","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["Lightweight preprocessing and fast query of geodesic distance via proximity graph"],"prefix":"10.1016","volume":"102","author":[{"given":"Shiqing","family":"Xin","sequence":"first","affiliation":[]},{"given":"Wenping","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Ying","family":"He","sequence":"additional","affiliation":[]},{"given":"Yuanfeng","family":"Zhou","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0835-3316","authenticated-orcid":false,"given":"Shuangmin","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Changhe","family":"Tu","sequence":"additional","affiliation":[]},{"given":"Zhenyu","family":"Shu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"9","key":"10.1016\/j.cad.2018.04.021_b1","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1016\/j.comgeo.2011.05.006","article-title":"A survey of geodesic paths on 3D surfaces","volume":"44","author":"Bose","year":"2011","journal-title":"Comput Geom Theory Appl"},{"issue":"3","key":"10.1016\/j.cad.2018.04.021_b2","doi-asserted-by":"crossref","first-page":"954","DOI":"10.1145\/882262.882369","article-title":"Hierarchical mesh decomposition using fuzzy clustering and cuts","volume":"22","author":"Katz","year":"2003","journal-title":"ACM Trans Graph"},{"key":"10.1016\/j.cad.2018.04.021_b3","unstructured":"Funkhouser T, Kazhdan M, Shilane P, Min P, Kiefer W, Tal A. et al. Modeling by Example."},{"key":"10.1016\/j.cad.2018.04.021_b4","series-title":"Proceedings of the 2001 symposium on interactive 3D graphics","first-page":"135","article-title":"Shape by example","author":"Sloan","year":"2001"},{"key":"10.1016\/j.cad.2018.04.021_b5","series-title":"SIGGRAPH\u201999","first-page":"49","article-title":"Robust mesh watermarking","author":"Praun","year":"1999"},{"key":"10.1016\/j.cad.2018.04.021_b6","series-title":"Proceedings of the ACM SIGGRAPH symposium on high performance graphics","first-page":"135","article-title":"Farthest-point optimized point sets with maximized minimum distance","author":"Schl\u00f6mer","year":"2011"},{"issue":"4","key":"10.1016\/j.cad.2018.04.021_b7","doi-asserted-by":"crossref","first-page":"99:1","DOI":"10.1145\/2461912.2461946","article-title":"Particle-based anisotropic surface meshing","volume":"32","author":"Zhong","year":"2013","journal-title":"ACM Trans Graph"},{"key":"10.1016\/j.cad.2018.04.021_b8","series-title":"Proceedings of the 11th european conference on computer vision: Part V","first-page":"771","article-title":"Geodesic shape retrieval via optimal mass transport","author":"Rabin","year":"2010"},{"issue":"8","key":"10.1016\/j.cad.2018.04.021_b9","doi-asserted-by":"crossref","first-page":"1502","DOI":"10.1109\/TPAMI.2010.221","article-title":"Construction of iso-contours, bisectors, and Voronoi diagrams on triangulated surfaces","volume":"33","author":"Liu","year":"2011","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"7","key":"10.1016\/j.cad.2018.04.021_b10","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1111\/cgf.12484","article-title":"Polyline-sourced Geodesic Voronoi diagrams on triangle meshes","volume":"33","author":"Xu","year":"2014","journal-title":"Comput Graph Forum"},{"issue":"6","key":"10.1016\/j.cad.2018.04.021_b11","doi-asserted-by":"crossref","first-page":"243:1","DOI":"10.1145\/2980179.2982424","article-title":"Manifold differential evolution (MDE): a global optimization method for geodesic centroidal Voronoi tessellations on meshes","volume":"35","author":"Liu","year":"2016","journal-title":"ACM Trans Graph"},{"issue":"6","key":"10.1016\/j.cad.2018.04.021_b12","doi-asserted-by":"crossref","first-page":"174:1","DOI":"10.1145\/2816795.2818076","article-title":"Efficient construction and simplification of Delaunay meshes","volume":"34","author":"Liu","year":"2015","journal-title":"ACM Trans Graph"},{"key":"10.1016\/j.cad.2018.04.021_b13","series-title":"Scale space and PDE methods in computer vision","article-title":"Texture mapping via spherical multi-dimensional scaling","volume":"vol. 3459","year":"2005"},{"key":"10.1016\/j.cad.2018.04.021_b14","series-title":"Proceedings of the 2004 Eurographics\/ACM SIGGRAPH symposium on geometry processing","first-page":"45","article-title":"Iso-charts: Stretch-driven mesh parameterization using spectral analysis","author":"Zhou","year":"2004"},{"issue":"1","key":"10.1016\/j.cad.2018.04.021_b15","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s11263-006-6859-3","volume":"69","year":"2006","journal-title":"Int J Comput Vis"},{"key":"10.1016\/j.cad.2018.04.021_b16","series-title":"ACM SIGGRAPH 2012 posters","first-page":"96:1","article-title":"Non-rigid shape correspondence and description using geodesic field estimate distribution","author":"New","year":"2012"},{"key":"10.1016\/j.cad.2018.04.021_b17","series-title":"Geometric shortest paths and network optimization handbook of computational geometry","first-page":"49","author":"Mitchell","year":"2015"},{"issue":"8","key":"10.1016\/j.cad.2018.04.021_b18","doi-asserted-by":"crossref","first-page":"995","DOI":"10.1109\/TMI.2004.831793","article-title":"Principal geodesic analysis for the study of nonlinear statistics of shape","volume":"23","author":"Fletcher","year":"2004","journal-title":"IEEE Trans Med Imaging"},{"key":"10.1016\/j.cad.2018.04.021_b19","doi-asserted-by":"crossref","first-page":"982","DOI":"10.1145\/185675.185795","article-title":"Shortest paths in the plane with polygonal obstacles","volume":"41","author":"Storer","year":"1994","journal-title":"J ACM"},{"issue":"4","key":"10.1016\/j.cad.2018.04.021_b20","doi-asserted-by":"crossref","first-page":"43:1","DOI":"10.1145\/1778765.1778780","article-title":"Geodesic patterns","volume":"29","author":"Pottmann","year":"2010","journal-title":"ACM Trans Graph"},{"issue":"4","key":"10.1016\/j.cad.2018.04.021_b21","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 Comput"},{"key":"10.1016\/j.cad.2018.04.021_b22","series-title":"Proceedings of the sixth annual symposium on computational geometry","first-page":"360","article-title":"Shortest paths on a polyhedron","author":"Chen","year":"1990"},{"issue":"3","key":"10.1016\/j.cad.2018.04.021_b23","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1145\/1073204.1073228","article-title":"Fast exact and approximate geodesics on meshes","volume":"24","author":"Surazhsky","year":"2005","journal-title":"ACM Trans Graph"},{"key":"10.1016\/j.cad.2018.04.021_b24","doi-asserted-by":"crossref","DOI":"10.1145\/1559755.1559761","article-title":"Improving Chen and Han\u2019s algorithm on the discrete geodesic problem","volume":"28","author":"Xin","year":"2009","journal-title":"ACM Trans Graph"},{"issue":"7","key":"10.1016\/j.cad.2018.04.021_b25","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1109\/TVCG.2015.2407404","article-title":"Fast Wavefront Propagation (FWP) for Computing Exact Geodesic Distances on Meshes","volume":"21","author":"Xu","year":"2015","journal-title":"IEEE Trans Vis Comput Graph"},{"issue":"3","key":"10.1016\/j.cad.2018.04.021_b26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2866570","article-title":"Intrinsic girth function for shape processing","volume":"35","author":"Xin","year":"2015","journal-title":"ACM Trans Graph"},{"issue":"4","key":"10.1016\/j.cad.2018.04.021_b27","doi-asserted-by":"crossref","DOI":"10.1145\/2897824.2925930","article-title":"Fast and exact discrete geodesic computation based on triangle-oriented wavefront propagation","volume":"35","author":"Qin","year":"2016","journal-title":"ACM Trans Graph"},{"key":"10.1016\/j.cad.2018.04.021_b28","series-title":"Proceedings of the 46th annual ACM symposium on theory of computing","first-page":"373","article-title":"Shortest paths on polyhedral surfaces and terrains","author":"Cheng","year":"2014"},{"key":"10.1016\/j.cad.2018.04.021_b29","series-title":"Proceedings of the 18th annual ACM-SIAM symposium on discrete algorithms","article-title":"Approximate shortest paths in anisotropic regions","author":"Cheng","year":"2007"},{"key":"10.1016\/j.cad.2018.04.021_b30","series-title":"Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms","article-title":"Better approximation algorithms for the graph diameter","author":"Chechik","year":"2014"},{"key":"10.1016\/j.cad.2018.04.021_b31","series-title":"Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms","article-title":"Near linear time (1 + \u03f5)-approximation for restricted shortest paths in undirected graphs","author":"Bernstein","year":"2012"},{"issue":"15","key":"10.1016\/j.cad.2018.04.021_b32","doi-asserted-by":"crossref","first-page":"8431","DOI":"10.1073\/pnas.95.15.8431","article-title":"Computing geodesic paths on manifolds","volume":"95","author":"Kimmel","year":"1998","journal-title":"Proc Natl Acad Sci"},{"issue":"4","key":"10.1016\/j.cad.2018.04.021_b33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1409625.1409626","article-title":"Parallel algorithms for approximation of distance maps on parametric surfaces","volume":"27","author":"Weber","year":"2008","journal-title":"ACM Trans Graph (TOG)"},{"issue":"5","key":"10.1016\/j.cad.2018.04.021_b34","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1145\/2516971.2516977","article-title":"Geodesics in heat: A new approach to computing distance based on heat flow","volume":"32","author":"Crane","year":"2013","journal-title":"ACM Trans Graph"},{"issue":"6","key":"10.1016\/j.cad.2018.04.021_b35","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/2508363.2508379","article-title":"Saddle vertex graph (SVG): a novel solution to the discrete geodesic problem","volume":"32","author":"Ying","year":"2013","journal-title":"ACM Trans Graph"},{"issue":"1","key":"10.1016\/j.cad.2018.04.021_b36","doi-asserted-by":"crossref","first-page":"9:1","DOI":"10.1145\/2534161","article-title":"Parallel Chen-Han (PCH) algorithm for discrete geodesics","volume":"33","author":"Ying","year":"2014","journal-title":"ACM Trans Graph"},{"issue":"4","key":"10.1016\/j.cad.2018.04.021_b37","doi-asserted-by":"crossref","first-page":"67:1","DOI":"10.1145\/2601097.2601175","article-title":"Earth mover\u2019s distances on discrete surfaces","volume":"33","author":"Solomon","year":"2014","journal-title":"ACM Trans Graph"},{"issue":"8","key":"10.1016\/j.cad.2018.04.021_b38","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1111\/cgf.12611","article-title":"On variational and PDE-based distance function approximations","volume":"34","author":"Belyaev","year":"2015","journal-title":"Comput Graph Forum"},{"issue":"5","key":"10.1016\/j.cad.2018.04.021_b39","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1111\/cgf.12173","article-title":"Practical anisotropic geodesy","volume":"32","author":"Campen","year":"2013","journal-title":"Comput Graph Forum"},{"issue":"3\u20134","key":"10.1016\/j.cad.2018.04.021_b40","first-page":"197","article-title":"Geodesic methods in computer vision and graphics","volume":"5","author":"Peyr\u00e9","year":"2010","journal-title":"Found Trends Comput Graph Vis"},{"key":"10.1016\/j.cad.2018.04.021_b41","series-title":"VISAPP (1)","first-page":"371","article-title":"Faster approximations of shortest geodesic paths on polyhedra through adaptive priority queue","author":"Schwartz","year":"2015"},{"issue":"8","key":"10.1016\/j.cad.2018.04.021_b42","doi-asserted-by":"crossref","first-page":"1403","DOI":"10.1002\/nme.1620210805","article-title":"A new mesh generation scheme for arbitrary planar domains","volume":"21","author":"Lo","year":"1985","journal-title":"Internat J Numer Methods Engrg"},{"issue":"3","key":"10.1016\/j.cad.2018.04.021_b43","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1145\/1141911.1141930","article-title":"Interactive decal compositing with discrete exponential maps","volume":"25","author":"Schmidt","year":"2006","journal-title":"ACM Trans Graph"},{"issue":"3","key":"10.1016\/j.cad.2018.04.021_b44","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1145\/1015706.1015716","article-title":"Energy-minimizing splines in manifolds","volume":"23","author":"Hofer","year":"2004","journal-title":"ACM Trans Graph"},{"issue":"7","key":"10.1016\/j.cad.2018.04.021_b45","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1016\/j.cagd.2013.06.002","article-title":"De Casteljau\u2019s algorithm on manifolds","volume":"30","author":"Nava-Yazdani","year":"2013","journal-title":"Comput Aided Geom Design"}],"container-title":["Computer-Aided Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0010448518302306?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0010448518302306?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T20:37:43Z","timestamp":1762115863000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0010448518302306"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":45,"alternative-id":["S0010448518302306"],"URL":"https:\/\/doi.org\/10.1016\/j.cad.2018.04.021","relation":{},"ISSN":["0010-4485"],"issn-type":[{"type":"print","value":"0010-4485"}],"subject":[],"published":{"date-parts":[[2018,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Lightweight preprocessing and fast query of geodesic distance via proximity graph","name":"articletitle","label":"Article Title"},{"value":"Computer-Aided Design","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cad.2018.04.021","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}