{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T02:40:09Z","timestamp":1748832009433,"version":"3.41.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319321486"},{"type":"electronic","value":"9783319321493"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-32149-3_52","type":"book-chapter","created":{"date-parts":[[2016,4,1]],"date-time":"2016-04-01T02:24:42Z","timestamp":1459477482000},"page":"559-569","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Massively Parallel Construction of the Cell Graph"],"prefix":"10.1007","author":[{"given":"Krzysztof","family":"Kaczmarski","sequence":"first","affiliation":[]},{"given":"Pawe\u0142","family":"Rz\u0105\u017cewski","sequence":"additional","affiliation":[]},{"given":"Albert","family":"Wolant","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,2]]},"reference":[{"key":"52_CR1","first-page":"390","volume":"14","author":"PC Chen","year":"1998","unstructured":"Chen, P.C., Hwang, Y.K.: SANDROS: a dynamic graph search algorithm for motion planning. ICRA 14, 390 (1998)","journal-title":"ICRA"},{"key":"52_CR2","doi-asserted-by":"crossref","unstructured":"Canny, J.: A new algebraic method for robot motion planning and real geometry. In: Proceedings of SFCS 1987, pp. 39\u201348 (1987)","DOI":"10.1109\/SFCS.1987.1"},{"key":"52_CR3","doi-asserted-by":"crossref","unstructured":"Dobrowolski, P.: An efficient method of constructing cell graph in arrangement of quadrics in 3-dimensional space of rotations. In: Proceedings of SII, pp. 671\u2013676. IEEE (2013)","DOI":"10.1109\/SII.2013.6776602"},{"key":"52_CR4","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.ipl.2007.08.021","volume":"105","author":"S Grabowski","year":"2008","unstructured":"Grabowski, S., Fredriksson, K.: Bit-parallel string matching under hamming distance in worst case time. Inf. Process. Lett. 105, 182\u2013187 (2008)","journal-title":"Inf. Process. Lett."},{"key":"52_CR5","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1145\/136035.136037","volume":"24","author":"YK Hwang","year":"1992","unstructured":"Hwang, Y.K., Ahuja, N.: Gross motion planning - a survey. ACM Comput. Surv. 24, 219\u2013291 (1992)","journal-title":"ACM Comput. Surv."},{"key":"52_CR6","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-319-10518-5_16","volume-title":"New Trends in Database and Information Systems II","author":"K Kaczmarski","year":"2015","unstructured":"Kaczmarski, K., Przymus, P., Rz\u0105\u017cewski, P.: Improving high-performance GPU graph traversal with compression. In: Bassiliades, N., Ivanovic, M., Kon-Popovska, M., Manolopoulos, Y., Palpanas, T., Trajcevski, G., Vakali, A. (eds.) New Trends in Database and Information Systems II. AISC, vol. 312, pp. 201\u2013214. Springer, Heidelberg (2015)"},{"key":"52_CR7","volume-title":"Programming Massively Parallel Processors: A Hands-on Approach","author":"DB Kirk","year":"2012","unstructured":"Kirk, D.B., Wen-mei, W.H.: Programming Massively Parallel Processors: A Hands-on Approach. Newnes, Boston (2012)"},{"key":"52_CR8","doi-asserted-by":"crossref","unstructured":"Liu, Y., Guo, L., Li, J., Ren, M., Li, K.: Parallel algorithms for approximate string matching with $$k$$ mismatches on CUDA. In: IPDPS 2012, pp. 2414\u20132422 (2012)","DOI":"10.1109\/IPDPSW.2012.298"},{"issue":"8","key":"52_CR9","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/2370036.2145832","volume":"47","author":"Duane Merrill","year":"2012","unstructured":"Merrill, D., Garland, M., Grimshaw, A.S.: Scalable GPU graph traversal. In: PPOPP, pp. 117\u2013128. ACM (2012)","journal-title":"ACM SIGPLAN Notices"},{"key":"52_CR10","unstructured":"NVIDIA Corporation. NVIDIA CUDA C Best Practices Guide 6.5 (2014). docs.nvidia.com\/cuda\/cuda-c-best-practices-guide"},{"key":"52_CR11","doi-asserted-by":"crossref","unstructured":"Pan, J., Lauterbach, C., Manocha, D.: Efficient nearest-neighbor computation for GPU-based motion planning. In: IEEE\/RSJ International Conference on Intelligent Robots and Systems, pp. 2243\u20132248 (2010)","DOI":"10.1109\/IROS.2010.5651449"},{"key":"52_CR12","first-page":"124","volume-title":"Graphics Gems III","author":"K Shoemake","year":"1992","unstructured":"Shoemake, K.: Uniform Random Rotations. In: Kirk, D. (ed.) Graphics Gems III, pp. 124\u2013132. Academic Press Professional Inc., San Diego (1992)"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-32149-3_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T02:16:34Z","timestamp":1748830594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-32149-3_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319321486","9783319321493"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32149-3_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"2 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}