{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:05:40Z","timestamp":1754481940518},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540771180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77120-3_58","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T11:31:09Z","timestamp":1196940669000},"page":"668-680","source":"Crossref","is-referenced-by-count":1,"title":["An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane"],"prefix":"10.1007","author":[{"given":"Anil","family":"Maheshwari","sequence":"first","affiliation":[]},{"given":"Doron","family":"Nussbaum","sequence":"additional","affiliation":[]},{"given":"J\u00f6rg-R\u00fcdiger","family":"Sack","sequence":"additional","affiliation":[]},{"given":"Jiehua","family":"Yi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"58_CR1","unstructured":"Berkman, O., Schieber, B., Vishkin, U.: Some doubly logarithmic optimal parallel algorithm based on finding all nearest smaller values. Technical Report, University of Maryland, UMIACS-TR-88-79 (1988)"},{"key":"58_CR2","doi-asserted-by":"crossref","unstructured":"Chang, E.C., Choi, S.W., Kwon, D.Y., Park, H., Yap, C.K.: Shortest path amidst disc obstacles is computable. In: Proc. of the 21st annual Symposium on Computational Geometry (SoCG), pp. 116\u2013125 (2005)","DOI":"10.1145\/1064092.1064112"},{"key":"58_CR3","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.cad.2005.11.001","volume":"38","author":"L. Jin","year":"2006","unstructured":"Jin, L., Kim, D., Mu, L., Kim, D-S., Hu, S.-M.: A sweepline algorithm for Euclidean Voronoi diagram of circles. Computer-Aided Design\u00a038, 260\u2013272 (2006)","journal-title":"Computer-Aided Design"},{"key":"58_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/978-3-540-24767-8_7","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2004","author":"D.S. Kim","year":"2004","unstructured":"Kim, D.S., Yu, K., Cho, Y., Kim, D., Yap, C.: Shortest path for disc obstacles. In: Lagan\u00e0, A., Gavrilova, M., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol.\u00a03045, pp. 62\u201370. Springer, Heidelberg (2004)"},{"key":"58_CR5","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1016\/B978-044482537-7\/50016-4","volume-title":"Handbook of Computational Geometry","author":"J.S.B. Mitchell","year":"2000","unstructured":"Mitchell, J.S.B: Geometric shortest paths and network optimization. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 633\u2013701. Elsevier, Amsterdam (2000)"},{"key":"58_CR6","unstructured":"van den Berg, J.: Path planning in dynamic environments. Ph.D. Thesis, Utrecht University, Utrecht, The Netherlands (2007)"},{"key":"58_CR7","unstructured":"van den Berg, J., Overmars, M.: Planning the shortest safe path amidst unpredictably moving obstacles. In: Proc. Workshop on Algorithmic Foundations of Robotics (2006)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77120-3_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:01:21Z","timestamp":1619521281000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77120-3_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540771180"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77120-3_58","relation":{},"subject":[]}}