{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:37:18Z","timestamp":1771699038146,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319165943","type":"print"},{"value":"9783319165950","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-16595-0_12","type":"book-chapter","created":{"date-parts":[[2015,4,29]],"date-time":"2015-04-29T13:42:10Z","timestamp":1430314930000},"page":"197-214","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Fast Nearest Neighbor Search in SE(3) for Sampling-Based Motion Planning"],"prefix":"10.1007","author":[{"given":"Jeffrey","family":"Ichnowski","sequence":"first","affiliation":[]},{"given":"Ron","family":"Alterovitz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,30]]},"reference":[{"key":"12_CR1","volume-title":"Principles of Robot Motion: Theory, Algorithms, and Implementations","author":"H Choset","year":"2005","unstructured":"Choset, H., Lynch, K.M., Hutchinson, S.A., Kantor, G.A., Burgard, W., Kavraki, L.E., Thrun, S.: Principles of Robot Motion: Theory, Algorithms, and Implementations. MIT Press, Cambridge (2005)"},{"issue":"7","key":"12_CR2","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1177\/0278364911406761","volume":"30","author":"S Karaman","year":"2011","unstructured":"Karaman, S., Frazzoli, E.: Sampling-based algorithms for optimal motion planning. Int. J. Robot. Res. 30(7), 846\u2013894 (2011)","journal-title":"Int. J. Robot. Res."},{"issue":"4","key":"12_CR3","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1109\/MRA.2012.2205651","volume":"19","author":"IA \u015eucan","year":"2012","unstructured":"\u015eucan, I.A., Moll, M., Kavraki, L.E.: The open motion planning library. IEEE Robot. Autom. Mag. 19(4), 72\u201382 (2012)","journal-title":"IEEE Robot. Autom. Mag."},{"issue":"9","key":"12_CR4","doi-asserted-by":"publisher","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(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"issue":"3","key":"12_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"JH Friedman","year":"1977","unstructured":"Friedman, J.H., Bentley, J.L., Finkel, R.A.: An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw. (TOMS) 3(3), 209\u2013226 (1977)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"1\u20136","key":"12_CR6","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/BF01759061","volume":"6","author":"RF Sproull","year":"1991","unstructured":"Sproull, R.F.: Refinements to nearest-neighbor searching in k-dimensional trees. Algorithmica 6(1\u20136), 579\u2013589 (1991)","journal-title":"Algorithmica"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"RA Finkel","year":"1974","unstructured":"Finkel, R.A., Bentley, J.L.: Quad trees a data structure for retrieval on composite keys. Acta Inform. 4(1), 1\u20139 (1974)","journal-title":"Acta Inform."},{"key":"12_CR8","unstructured":"Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proceedings of the ACM-SIAM Symposium Discrete Algorithms (1993)"},{"issue":"4","key":"12_CR9","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0196-6774(80)90015-2","volume":"1","author":"JL Bentley","year":"1980","unstructured":"Bentley, J.L., Saxe, J.B.: Decomposable searching problems I. Static-to-dynamic transformation. J. Algorithms 1(4), 301\u2013358 (1980)","journal-title":"J. Algorithms"},{"issue":"1","key":"12_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1109\/TRO.2006.886840","volume":"23","author":"A Yershova","year":"2007","unstructured":"Yershova, A., LaValle, S.M.: Improving motion-planning algorithms by efficient nearest-neighbor searching. IEEE Trans. Robot. 23(1), 151\u2013157 (2007)","journal-title":"IEEE Trans. Robot."},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/325165.325242","volume":"19","author":"K Shoemake","year":"1985","unstructured":"Shoemake, K.: Animating rotation with quaternion curves. Proc. ACM SIGGRAPH 19(3), 245\u2013254 (1985)","journal-title":"Proc. ACM SIGGRAPH"},{"key":"12_CR12","unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: Proceedings of the International Conference Very Large Databases (1995)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Beygelzimer, A., Kakade, S., Langford, J.: Cover trees for nearest neighbor. In: Proceedings of the International Conference Machine Learning, pp. 97\u2013104. ACM (2006)","DOI":"10.1145\/1143844.1143857"},{"key":"12_CR14","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: Proceedings of the International Conference Very Large Databases, p. 426 (1997)"},{"key":"12_CR15","volume-title":"Handbook of Discrete and Computational Geometry","author":"P Indyk","year":"2004","unstructured":"Indyk, P.: Nearest neighbors in high-dimensional spaces. Handbook of Discrete and Computational Geometry, 2nd edn. Chapman and Hall\/CRC, New York (2004)","edition":"2"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-68405-3_1","volume-title":"Algorithmic Foundation of Robotics VII","author":"E Plaku","year":"2008","unstructured":"Plaku, E., Kavraki, L.E.: Quantitative analysis of nearest-neighbors search in high-dimensional sampling-based motion planning. Algorithmic Foundation of Robotics VII, pp. 3\u201318. Springer, New York (2008)"},{"issue":"6","key":"12_CR17","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S Arya","year":"1998","unstructured":"Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM 45(6), 891\u2013923 (1998)","journal-title":"J. ACM"},{"issue":"2","key":"12_CR18","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1137\/S0097539798347177","volume":"30","author":"E Kushilevitz","year":"2000","unstructured":"Kushilevitz, E., Ostrovsky, R., Rabani, Y.: Efficient search for approximate nearest neighbor in high dimensional spaces. SIAM J. Comput. 30(2), 457\u2013474 (2000)","journal-title":"SIAM J. Comput."},{"key":"12_CR19","unstructured":"Muja, M., Lowe, D.G.: Fast approximate nearest neighbors with automatic algorithm configuration. In: International Conference Computer Vision Theory and Application (VISSAPP), pp. 331\u2013340. INSTICC Press (2009)"},{"key":"12_CR20","unstructured":"Mount, D.M.: ANN programming manual. Technical report Department of Computer Science, University of Maryland (1998)"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Yershova, A., LaValle, S.M.: Deterministic sampling methods for spheres and SO(3). In: Proceedings of the IEEE International Conference Robotics and Automation, pp. 3974\u20133980 (2004)","DOI":"10.1109\/ROBOT.2004.1308891"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Nowakiewicz, M.: Mst-based method for 6d of rigid body motion planning in narrow passages. In: Proceedings of the IEEE\/RSJ International Conference Intelligent Robots and Systems (IROS), pp. 5380\u20135385. IEEE (2010)","DOI":"10.1109\/IROS.2010.5650577"},{"key":"12_CR23","volume-title":"The art of computer programming. Sorting and Searching","author":"DE Knuth","year":"1998","unstructured":"Knuth, D.E.: The art of computer programming. Sorting and Searching, 2nd edn. Addison Wesley Longman Publishing Co., Inc., Redwood (1998)","edition":"2"},{"key":"12_CR24","first-page":"293","volume-title":"Algorithmic and Computational Robotics: New Directions","author":"SM LaValle","year":"2001","unstructured":"LaValle, S.M., Kuffner, J.J.: Rapidly-exploring random trees: progress and prospects. In: Donald, B.R. (ed.) Algorithmic and Computational Robotics: New Directions, pp. 293\u2013308. AK Peters, Natick (2001)"}],"container-title":["Springer Tracts in Advanced Robotics","Algorithmic Foundations of Robotics XI"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-16595-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T02:47:53Z","timestamp":1676947673000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-16595-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319165943","9783319165950"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-16595-0_12","relation":{},"ISSN":["1610-7438","1610-742X"],"issn-type":[{"value":"1610-7438","type":"print"},{"value":"1610-742X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"30 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}