{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T09:23:57Z","timestamp":1725873837610},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319508344"},{"type":"electronic","value":"9783319508351"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-50835-1_53","type":"book-chapter","created":{"date-parts":[[2016,12,9]],"date-time":"2016-12-09T00:42:52Z","timestamp":1481244172000},"page":"593-602","source":"Crossref","is-referenced-by-count":4,"title":["Parallelized Iterative Closest Point for Autonomous Aerial Refueling"],"prefix":"10.1007","author":[{"given":"Jace","family":"Robinson","sequence":"first","affiliation":[]},{"given":"Matt","family":"Piekenbrock","sequence":"additional","affiliation":[]},{"given":"Lee","family":"Burchett","sequence":"additional","affiliation":[]},{"given":"Scott","family":"Nykl","sequence":"additional","affiliation":[]},{"given":"Brian","family":"Woolley","sequence":"additional","affiliation":[]},{"given":"Andrew","family":"Terzuoli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,10]]},"reference":[{"key":"53_CR1","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1109\/JPROC.2008.917757","volume":"96","author":"JD Owens","year":"2008","unstructured":"Owens, J.D., Houston, M., Luebke, D., Green, S., Stone, J.E., Phillips, J.C.: GPU computing. Proc. IEEE 96, 879\u2013899 (2008)","journal-title":"Proc. IEEE"},{"key":"53_CR2","unstructured":"Nvidia, C.: Compute unified device architecture programming guide (2007)"},{"key":"53_CR3","doi-asserted-by":"crossref","unstructured":"Besl, P.J., McKay, N.D.: Method for registration of 3-D shapes. In: Robotics-DL Tentative, pp. 586\u2013606. International Society for Optics and Photonics (1992)","DOI":"10.1109\/34.121791"},{"key":"53_CR4","unstructured":"Mount, D.M.: GTS: GNU Triangulated Surface library (2000\u20132004)"},{"key":"53_CR5","doi-asserted-by":"crossref","unstructured":"Rusu, R.B., Cousins, S.: 3D is here: point cloud library (PCL). In: ICRA. IEEE (2011)","DOI":"10.1109\/ICRA.2011.5980567"},{"key":"53_CR6","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18, 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"key":"53_CR7","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 604\u2013613. ACM (1998)","DOI":"10.1145\/276698.276876"},{"key":"53_CR8","unstructured":"Gieseke, F., Heinermann, J., Oancea, C., Igel, C.: Buffer kd trees: processing massive nearest neighbor queries on GPUs. In: Proceedings of The 31st International Conference on Machine Learning, pp. 172\u2013180 (2014)"},{"key":"53_CR9","doi-asserted-by":"crossref","unstructured":"Garcia, V., Debreuve, E., Barlaud, M.: Fast k nearest neighbor search using GPU. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, CVPRW 2008, pp. 1\u20136. IEEE (2008)","DOI":"10.1109\/CVPRW.2008.4563100"},{"key":"53_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-319-25087-8_25","volume-title":"Similarity Search and Applications","author":"S Li","year":"2015","unstructured":"Li, S., Amenta, N.: Brute-force k-nearest neighbors search on the GPU. In: Amato, G., Connor, R., Falchi, F., Gennaro, C. (eds.) SISAP 2015. LNCS, vol. 9371, pp. 259\u2013270. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-25087-8_25"},{"key":"53_CR11","doi-asserted-by":"crossref","first-page":"105","DOI":"10.5194\/isprsannals-I-3-105-2012","volume":"3","author":"D Eggert","year":"2012","unstructured":"Eggert, D., Dalyot, S.: Octree-based SIMD strategy for ICP registration and alignment of 3D point clouds. ISPRS Ann. Photogramm. Remote Sens. Spat. Inf. Sci. 3, 105\u2013110 (2012)","journal-title":"ISPRS Ann. Photogramm. Remote Sens. Spat. Inf. Sci."},{"key":"53_CR12","doi-asserted-by":"crossref","unstructured":"Abe, L.I., Iwao, Y., Gotoh, T., Kagei, S., Takimoto, R.Y., Tsuzuki, M., Iwasawa, T.: High-speed point cloud matching algorithm for medical volume images using 3D voronoi diagram. In: 2014 7th International Conference on Biomedical Engineering and Informatics, pp. 205\u2013210. IEEE (2014)","DOI":"10.1109\/BMEI.2014.7002771"},{"key":"53_CR13","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1093\/comjnl\/21.2.168","volume":"21","author":"PJ Green","year":"1978","unstructured":"Green, P.J., Sibson, R.: Computing dirichlet tessellations in the plane. Comput. J. 21, 168\u2013173 (1978)","journal-title":"Comput. J."},{"key":"53_CR14","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0925-7721(98)00035-2","volume":"12","author":"EP Mcke","year":"1999","unstructured":"Mcke, E.P., Saias, I., Zhu, B.: Fast randomized point location without preprocessing in two-and three-dimensional delaunay triangulations. Comput. Geom. 12, 63\u201383 (1999)","journal-title":"Comput. Geom."},{"key":"53_CR15","unstructured":"Delaunay, B.: Sur la sphere vide. Izv. Akad. Nauk SSSR, Otdelenie Matematicheskii i Estestvennyka Nauk 7, 1\u20132 (1934)"},{"key":"53_CR16","unstructured":"Greenspan, M., Yurick, M.: Approximate KD tree search for efficient ICP. In: Proceedings of the Fourth International Conference on 3-D Digital Imaging and Modeling, 3DIM 2003, pp. 442\u2013448. IEEE (2003)"},{"key":"53_CR17","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10766-011-0186-1","volume":"40","author":"A Santos","year":"2012","unstructured":"Santos, A., Teixeira, J.M., Farias, T., Teichrieb, V., Kelner, J.: Understanding the efficiency of kD-tree ray-traversal techniques over a GPGPU architecture. Int. J. Parallel Program. 40, 331\u2013352 (2012)","journal-title":"Int. J. Parallel Program."},{"key":"53_CR18","unstructured":"Werner, K.P.: Precision relative positioning for automated aerial refueling from a stereo imaging system. Technical report, DTIC Document (2015)"},{"key":"53_CR19","unstructured":"Levoy, M., Gerth, J., Curless, B., Pull, K.: The stanford 3D scanning repository (2005). http:\/\/www-graphics.stanford.edu\/data\/3dscanrep"},{"key":"53_CR20","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/93605.98741","volume":"19","author":"N Beckmann","year":"1990","unstructured":"Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The r*-tree: an efficient and robust access method for points and rectangles. ACM SIGMOD Rec. 19, 322\u2013331 (1990). ACM","journal-title":"ACM SIGMOD Rec."},{"key":"53_CR21","unstructured":"Meagher, D.J.: Octree encoding: a new technique for the representation, manipulation and display of arbitrary 3-D objects by computer. Electrical and Systems Engineering Department, Rensseiaer Polytechnic Institute Image Processing Laboratory (1980)"},{"key":"53_CR22","volume-title":"Linear Least-Squares Optimization for Point-to-Plane ICP Surface Registration","author":"KL Low","year":"2004","unstructured":"Low, K.L.: Linear Least-Squares Optimization for Point-to-Plane ICP Surface Registration, vol. 4. University of North Carolina, Chapel Hill (2004)"}],"container-title":["Lecture Notes in Computer Science","Advances in Visual Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50835-1_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T10:26:52Z","timestamp":1568629612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50835-1_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319508344","9783319508351"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50835-1_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}