乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T17:41:35Z","timestamp":1726422095917},"reference-count":35,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2014,11,1]],"date-time":"2014-11-01T00:00:00Z","timestamp":1414800000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"name":"University of Ministry of Education of China","award":["NCET-09-0665"]},{"name":"Scientific Research Fund of Sichuan Provincial Education Department","award":["12ZB152","12ZB153"]},{"name":"Key Technologies R&D Program of Mianyang Bureau","award":["12G032-1"]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Pattern Recognition Letters"],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1016\/j.patrec.2014.07.003","type":"journal-article","created":{"date-parts":[[2014,7,22]],"date-time":"2014-07-22T14:46:32Z","timestamp":1406040392000},"page":"162-170","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":12,"special_numbering":"C","title":["A new extracting algorithm of k nearest neighbors searching for point clouds"],"prefix":"10.1016","volume":"49","author":[{"given":"Zisheng","family":"Li","sequence":"first","affiliation":[]},{"given":"Guofu","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Rong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Shengfeng","family":"Qin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.patrec.2014.07.003_b0005","unstructured":"Dscanrep, 2004. URL: ."},{"key":"10.1016\/j.patrec.2014.07.003_b0010","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/PL00009475","article-title":"Surface reconstruction by Voronoi filtering","volume":"22","author":"Amenta","year":"1999","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.patrec.2014.07.003_b0015","series-title":"Proceedings of 16th Annual Symposium on Computational Geometry","first-page":"213","article-title":"A simple algorithm for homeomorphic surface reconstruction","author":"Amenta","year":"2000"},{"key":"10.1016\/j.patrec.2014.07.003_b0020","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1145\/293347.293348","article-title":"An optimal algorithm for approximate nearest neighbor searching fixed dimensions","volume":"45","author":"Arya","year":"1998","journal-title":"JACM"},{"key":"10.1016\/j.patrec.2014.07.003_b0025","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0167-8396(01)00085-1","article-title":"Constrained fitting in reverse engineering","volume":"19","author":"Benko","year":"2002","journal-title":"Comput. Aided Geom. D"},{"key":"10.1016\/j.patrec.2014.07.003_b0030","series-title":"Sixth Annual Symposium on Computational Geometry","first-page":"187","article-title":"K-d trees for semidynamic point sets","author":"Bentley","year":"1990"},{"key":"10.1016\/j.patrec.2014.07.003_b0035","doi-asserted-by":"crossref","first-page":"1765","DOI":"10.1111\/j.1467-8659.2012.03181.x","article-title":"Fast and robust normal estimation for point clouds with sharp features","volume":"31","author":"Boulch","year":"2012","journal-title":"Comput. Graph. Forum"},{"key":"10.1016\/j.patrec.2014.07.003_b0040","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s00778-011-0235-9","article-title":"Continuous reverse k nearest neighbors queries in euclidean space and in spatial networks","volume":"21","author":"Cheema","year":"2012","journal-title":"VLDB J."},{"key":"10.1016\/j.patrec.2014.07.003_b0045","series-title":"24th IEEE Annual Symposium on Foundations of Computer Science","first-page":"226","article-title":"Fast algorithm for the all nearest neighbors problem","author":"Clarkson","year":"1983"},{"key":"10.1016\/j.patrec.2014.07.003_b0050","doi-asserted-by":"crossref","first-page":"2207","DOI":"10.1016\/j.ins.2006.12.012","article-title":"A performance comparison of distance-based query algorithms using r-trees in spatial databases","volume":"177","author":"Corral","year":"2007","journal-title":"Inform. Sci."},{"key":"10.1016\/j.patrec.2014.07.003_b0055","doi-asserted-by":"crossref","first-page":"1437","DOI":"10.1016\/S0167-8655(02)00384-7","article-title":"PCA-based branch and bound search algorithms for computing k nearest neighbors","volume":"24","author":"Dhaes","year":"2003","journal-title":"Pattern Recognit. Lett."},{"key":"10.1016\/j.patrec.2014.07.003_b0060","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1016\/j.datak.2009.04.004","article-title":"On efficient mutual nearest neighbor query processing in spatial databases","volume":"68","author":"Gao","year":"2009","journal-title":"Data Knowl. Eng."},{"key":"10.1016\/j.patrec.2014.07.003_b0065","doi-asserted-by":"crossref","first-page":"904","DOI":"10.1016\/j.cag.2011.03.036","article-title":"Shape classification and normal estimation for non-uniformly sampled, noisy point data","volume":"35","author":"Grimm","year":"2011","journal-title":"Comput. Graph."},{"year":"2010","series-title":"Computer Graphics with OpenGL","author":"Hearn","key":"10.1016\/j.patrec.2014.07.003_b0070"},{"key":"10.1016\/j.patrec.2014.07.003_b0075","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1145\/142920.134011","article-title":"Surface reconstruction from unorganised points","volume":"26","author":"Hoppe","year":"1992","journal-title":"ACM SIGGRAPH Comput. Graph."},{"key":"10.1016\/j.patrec.2014.07.003_b0080","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.cag.2010.01.004","article-title":"Robust normal estimation for point clouds with sharp features","volume":"34","author":"Li","year":"2010","journal-title":"Comput. Graph."},{"key":"10.1016\/j.patrec.2014.07.003_b0085","unstructured":"Z. Li, 2013. ."},{"key":"10.1016\/j.patrec.2014.07.003_b0090","series-title":"2011 International Conference on Image Processing, Computer Vision, and Pattern Recognition","first-page":"860","article-title":"Evaluation of fast k-nearest neighbors search methods using real data sets","author":"Liaw","year":"2011"},{"key":"10.1016\/j.patrec.2014.07.003_b0095","doi-asserted-by":"crossref","first-page":"2351","DOI":"10.1016\/j.patcog.2010.01.003","article-title":"Fast exact k nearest neighbors search using an orthogonal search tree","volume":"43","author":"Liaw","year":"2010","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patrec.2014.07.003_b0100","first-page":"358","article-title":"Algorithm for finding k-nearest neighbors based on spatial sub-cubes and dynamic sphere","volume":"36","author":"Ma","year":"2011","journal-title":"Geomat. Inform. Sci. Wuhan Univ. (in Chinese)"},{"key":"10.1016\/j.patrec.2014.07.003_b0105","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1109\/34.955110","article-title":"A fast nearest-neighbor algorithm based on a principal axis search tree","volume":"23","author":"McNames","year":"2001","journal-title":"IEEE Trans. Pattern Anal."},{"key":"10.1016\/j.patrec.2014.07.003_b0110","unstructured":"D. Mount, S. Arya, ANN: a library for approximate nearest neighbor searching, in: CGC Second Annual Fall Workshop on Computational Geometry, 1997."},{"key":"10.1016\/j.patrec.2014.07.003_b0115","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0010-4485(00)00141-X","article-title":"Algorithm for finding all k nearest neighbors","volume":"34","author":"Piegl","year":"2002","journal-title":"Comput. Aided Des."},{"key":"10.1016\/j.patrec.2014.07.003_b0120","first-page":"65","article-title":"Novel algorithm for k-nearest neighbors of massive data based on spacial partition","volume":"35","author":"Ping","year":"2007","journal-title":"J. South China Univ. Technol. (Nat. Sci.) (in Chinese)"},{"key":"10.1016\/j.patrec.2014.07.003_b0125","unstructured":"Pointshop3d, 2004, ."},{"key":"10.1016\/j.patrec.2014.07.003_b0130","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.cag.2006.11.011","article-title":"A fast all nearest neighbor algorithm for applications involving large point-clouds","volume":"31","author":"Sankaranarayanan","year":"2007","journal-title":"Comput. Graph."},{"key":"10.1016\/j.patrec.2014.07.003_b0135","first-page":"23","article-title":"An approach to nearest neighboring search for multi-dimensional data","volume":"4","author":"Shi","year":"2010","journal-title":"Int. J. Future Gener. Commun. Network."},{"key":"10.1016\/j.patrec.2014.07.003_b0140","series-title":"Advances in Spatial and Temporal Databases","first-page":"79","article-title":"K-nearest neighbor search for moving query point","author":"Song","year":"2001"},{"key":"10.1016\/j.patrec.2014.07.003_b0145","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0010-4485(96)00054-1","article-title":"Reverse engineering of geometric models \u2013 an introduction","volume":"29","author":"Varady","year":"1997","journal-title":"Comput. Aided Des."},{"key":"10.1016\/j.patrec.2014.07.003_b0150","first-page":"944","article-title":"A spatial sphere algorithm for searching k-nearest neighbors of massive scattered points","volume":"27","author":"Wei","year":"2006","journal-title":"Chin. J. Aeronaut. (in Chinese)"},{"key":"10.1016\/j.patrec.2014.07.003_b0155","first-page":"909","article-title":"Algorithm for finding k-nearest neighbors of scattered points in three dimensions","volume":"16","author":"Xiong","year":"2004","journal-title":"J. CAD CG (in Chinese)"},{"key":"10.1016\/j.patrec.2014.07.003_b0160","series-title":"Fourth Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"311","article-title":"Data structures and algorithms for nearest neighbor search in general metric spaces","author":"Yianilos","year":"1983"},{"key":"10.1016\/j.patrec.2014.07.003_b0165","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/TPAMI.2004.1265868","article-title":"Fast k-nearest neighbor classification using cluster-based trees","volume":"26","author":"Zhang","year":"2004","journal-title":"IEEE Trans. Pattern Anal."},{"key":"10.1016\/j.patrec.2014.07.003_b0170","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S1007-0214(09)70071-9","article-title":"An improved algorithm for k-nearest-neighbor finding and surface normals estimation","volume":"14","author":"Zhao","year":"2009","journal-title":"Tsinghua Sci. Technol."},{"key":"10.1016\/j.patrec.2014.07.003_b0175","first-page":"615","article-title":"A new k-nearest neighbors search algorithm based on 3d cell grids","volume":"34","author":"Zhao","year":"2009","journal-title":"Geomat. Inform. Sci. Wuhan Univ. (in Chinese)"}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865514002165?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865514002165?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T09:34:18Z","timestamp":1656236058000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167865514002165"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11]]},"references-count":35,"alternative-id":["S0167865514002165"],"URL":"https:\/\/doi.org\/10.1016\/j.patrec.2014.07.003","relation":{},"ISSN":["0167-8655"],"issn-type":[{"type":"print","value":"0167-8655"}],"subject":[],"published":{"date-parts":[[2014,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A new extracting algorithm of k nearest neighbors searching for point clouds","name":"articletitle","label":"Article Title"},{"value":"Pattern Recognition Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.patrec.2014.07.003","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}