{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T03:11:34Z","timestamp":1775272294405,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030046507","type":"print"},{"value":"9783030046514","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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":[[2018]]},"DOI":"10.1007\/978-3-030-04651-4_2","type":"book-chapter","created":{"date-parts":[[2018,11,15]],"date-time":"2018-11-15T14:56:50Z","timestamp":1542293810000},"page":"19-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Rectilinear Shortest Paths Among Transient Obstacles"],"prefix":"10.1007","author":[{"given":"Anil","family":"Maheshwari","sequence":"first","affiliation":[]},{"given":"Arash","family":"Nouri","sequence":"additional","affiliation":[]},{"given":"J\u00f6rg-R\u00fcdiger","family":"Sack","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,16]]},"reference":[{"key":"2_CR1","unstructured":"Agarwal, P.K., Arge, L., Yi, K.: An optimal dynamic interval stabbing-max data structure? In: SODA 2005, pp. 803\u2013812 (2005)"},{"key":"2_CR2","unstructured":"Agarwal, P.K., Kumar, N., Sintos, S., Suri, S.: Computing shortest paths in the plane with removable obstacles. In SWAT 2018, pp. 5:1\u20135:15 (2018)"},{"issue":"3","key":"2_CR3","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1137\/0217026","volume":"17","author":"B Chazelle","year":"1988","unstructured":"Chazelle, B.: Functional approach to data structures and its use in multidimensional searching. SIAM J. Comput. 17(3), 427\u2013462 (1988)","journal-title":"SIAM J. Comput."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"de Rezende, P.J., Lee, D.T., Wu, Y.F.: Rectilinear shortest paths with rectangular barriers. In: SCG 1985, pp. 204\u2013213. ACM, New York (1985)","DOI":"10.1145\/323233.323260"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Fujimura, K.: On motion planning amidst transient obstacles. In: ICRA 1992, vol. 2, pp. 1488\u20131493, May 1992","DOI":"10.1109\/ROBOT.1992.220041"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Fujimura, K.: Motion planning using transient pixel representations. In: ICRA 1993, vol. 2, pp. 34\u201339, May 1993","DOI":"10.1109\/ROBOT.1993.292120"},{"issue":"5","key":"2_CR7","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1177\/027836499401300502","volume":"13","author":"K Fujimura","year":"1994","unstructured":"Fujimura, K.: Motion planning amid transient obstacles. Int. J. Robot. Res. 13(5), 395\u2013407 (1994)","journal-title":"Int. J. Robot. Res."},{"key":"2_CR8","unstructured":"Hershberger, J., Kumar, N., Suri, S.: Shortest paths in the plane with obstacle violations. In: ESA 2017, pp. 49:1\u201349:14 (2017)"},{"issue":"6","key":"2_CR9","doi-asserted-by":"publisher","first-page":"2215","DOI":"10.1137\/S0097539795289604","volume":"28","author":"J Hershberger","year":"1999","unstructured":"Hershberger, J., Suri, S.: An optimal algorithm for euclidean shortest paths in the plane. SIAM J. Comput. 28(6), 2215\u20132256 (1999)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"2_CR10","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D.: Optimal search in planar subdivisions. SIAM J. Comput. 12(1), 28\u201335 (1983)","journal-title":"SIAM J. Comput."},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"LaValle, S.M.: Planning Algorithms, pp. 495\u2013558. Cambridge University Press, Cambridge (2006)","DOI":"10.1017\/CBO9780511546877"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"LaValle, S.M., Sharma, R.: Robot motion planning in a changing, partially predictable environment. In: ISIC 1994, pp. 261\u2013266 (1994)","DOI":"10.1109\/ISIC.1994.367807"},{"issue":"3","key":"2_CR13","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0166-218X(96)80467-7","volume":"70","author":"DT Lee","year":"1996","unstructured":"Lee, D.T., Yang, C.D., Wong, C.K.: Rectilinear paths among rectilinear obstacles. Discret. Appl. Math. 70(3), 185\u2013215 (1996)","journal-title":"Discret. Appl. Math."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Maheshwari, A., Nouri, A., Sack, J.R.: Rectilinear shortest paths among transient obstacles. CoRR arXiv: abs\/1809.08898 (2018)","DOI":"10.1007\/978-3-030-04651-4_2"},{"issue":"1\u20136","key":"2_CR15","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF01758836","volume":"8","author":"JS Mitchell","year":"1992","unstructured":"Mitchell, J.S.: L1 shortest paths among polygonal obstacles in the plane. Algorithmica 8(1\u20136), 55\u201388 (1992)","journal-title":"Algorithmica"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Mitchell, J.S.B.: Shortest paths among obstacles in the plane. In: SCG 1993, pp. 308\u2013317. ACM, New York (1993)","DOI":"10.1145\/160985.161156"},{"issue":"2","key":"2_CR17","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/0196-6774(82)90016-5","volume":"3","author":"VK Vaishnavi","year":"1982","unstructured":"Vaishnavi, V.K., Wood, D.: Rectilinear line segment intersection, layered segment trees, and dynamization. J. Algorithms 3(2), 160\u2013176 (1982)","journal-title":"J. Algorithms"},{"issue":"3","key":"2_CR18","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1137\/S0097539792229672","volume":"24","author":"C Yang","year":"1995","unstructured":"Yang, C., Lee, D., Wong, C.: Rectilinear path problems among rectilinear obstacles revisited. SIAM J. Comput. 24(3), 457\u2013472 (1995)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04651-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T02:31:52Z","timestamp":1775269912000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04651-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046507","9783030046514"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04651-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spacl.kennesaw.edu\/cocoa2018\/cfp.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}