{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T03:11:35Z","timestamp":1775272295702,"version":"3.50.1"},"publisher-location":"Cham","reference-count":23,"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_12","type":"book-chapter","created":{"date-parts":[[2018,11,15]],"date-time":"2018-11-15T14:56:50Z","timestamp":1542293810000},"page":"169-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing a Rectilinear Shortest Path amid Splinegons in Plane"],"prefix":"10.1007","author":[{"given":"Tameem","family":"Choudhury","sequence":"first","affiliation":[]},{"given":"R.","family":"Inkulu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,16]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1137\/1.9781611973068.32","volume-title":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Pankaj K. Agarwal","year":"2009","unstructured":"Agarwal, P.K., Sharathkumar, R., Yu, H.: Approximate Euclidean shortest paths amid convex obstacles. In: Proceedings of Symposium on Discrete Algorithms, pp. 283\u2013292 (2009)"},{"issue":"4","key":"12_CR2","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1142\/S0218195994000252","volume":"4","author":"R Bar-Yehuda","year":"1994","unstructured":"Bar-Yehuda, R., Chazelle, B.: Triangulating disjoint Jordan chains. Int. J. Comput. Geom. Appl. 4(4), 475\u2013481 (1994)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"1","key":"12_CR3","first-page":"473","volume":"7","author":"DZ Chen","year":"2016","unstructured":"Chen, D.Z., Inkulu, R., Wang, H.: Two-point $$L_1$$ shortest path queries in the plane. J. Comput. Geom. 7(1), 473\u2013519 (2016)","journal-title":"J. Comput. Geom."},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-642-23719-5_41","volume-title":"Algorithms \u2013 ESA 2011","author":"DZ Chen","year":"2011","unstructured":"Chen, D.Z., Wang, H.: A nearly optimal algorithm for finding $$L_{1}$$ shortest paths among polygonal obstacles in the plane. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 481\u2013492. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23719-5_41"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Chen, D.Z., Wang, H.L.: Computing shortest paths among curved obstacles in the plane. In: Proceedings of Symposuim on Computational Geometry, pp. 369\u2013378 (2013)","DOI":"10.1145\/2462356.2462377"},{"issue":"4","key":"12_CR6","doi-asserted-by":"publisher","first-page":"26:1","DOI":"10.1145\/2660771","volume":"11","author":"DZ Chen","year":"2015","unstructured":"Chen, D.Z., Wang, H.: Computing shortest paths among curved obstacles in the plane. ACM Trans. Algorithms 11(4), 26:1\u201326:46 (2015)","journal-title":"ACM Trans. Algorithms"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L., Kapoor, S., Vaidya, P.M.: Rectilinear shortest paths through polygonal obstacles in $$O(n(\\lg {n})^2)$$ time. In: Proceedings of Symposium on Computational Geometry, pp. 251\u2013257 (1987)","DOI":"10.1145\/41958.41985"},{"issue":"3","key":"12_CR8","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/BF01840397","volume":"5","author":"DP Dobkin","year":"1990","unstructured":"Dobkin, D.P., Souvaine, D.L.: Computational geometry in a curved world. Algorithmica 5(3), 421\u2013457 (1990)","journal-title":"Algorithmica"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/BF01762127","volume":"3","author":"DP Dobkin","year":"1988","unstructured":"Dobkin, D.P., Souvaine, D.L., Van Wyk, C.J.: Decomposition and intersection of simple splinegons. Algorithmica 3, 473\u2013485 (1988)","journal-title":"Algorithmica"},{"key":"12_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543340","volume-title":"Visibility Algorithms in the Plane","author":"SK Ghosh","year":"2007","unstructured":"Ghosh, S.K.: Visibility Algorithms in the Plane. Cambridge University Press, New York (2007)"},{"issue":"5","key":"12_CR11","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1137\/0220055","volume":"20","author":"SK Ghosh","year":"1991","unstructured":"Ghosh, S.K., Mount, D.M.: An output-sensitive algorithm for computing visibility graphs. SIAM J. Comput. 20(5), 888\u2013910 (1991)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"12_CR12","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."},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Hershberger, J., Suri, S., Yildiz, H.: A near-optimal algorithm for shortest paths among curved obstacles in the plane. In: Proceedings of Symposuim on Computational Geometry, pp. 359\u2013368 (2013)","DOI":"10.1145\/2462356.2462374"},{"issue":"9","key":"12_CR14","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/j.comgeo.2009.02.005","volume":"42","author":"R Inkulu","year":"2009","unstructured":"Inkulu, R., Kapoor, S.: Planar rectilinear shortest path computation using corridors. Comput. Geom. 42(9), 873\u2013884 (2009)","journal-title":"Comput. Geom."},{"key":"12_CR15","unstructured":"Inkulu, R., Kapoor, S.: Approximate Euclidean shortest paths amid polygonal obstacles. CoRR, abs\/1506.01769 (2015)"},{"key":"12_CR16","unstructured":"Inkulu, R., Kapoor, S., Maheshwari, S.N.: A near optimal algorithm for finding Euclidean shortest path in polygonal domain. CoRR, abs\/1011.6481 (2010)"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Kapoor, S., Maheshwari, S.N.: Efficent algorithms for Euclidean shortest path and visibility problems with polygonal obstacles. In: Proceedings of Symposium on Computational Geometry, pp. 172\u2013182 (1988)","DOI":"10.1145\/73393.73411"},{"issue":"3","key":"12_CR18","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1137\/S0097539795253591","volume":"30","author":"S Kapoor","year":"2000","unstructured":"Kapoor, S., Maheshwari, S.N.: Efficiently constructing the visibility graph of a simple polygon with obstacles. SIAM J. Comput. 30(3), 847\u2013871 (2000)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"12_CR19","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/PL00009323","volume":"18","author":"S Kapoor","year":"1997","unstructured":"Kapoor, S., Maheshwari, S.N., Mitchell, J.S.B.: An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane. Discrete Comput. Geom. 18(4), 377\u2013383 (1997)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"12_CR20","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/0221038","volume":"21","author":"EA Melissaratos","year":"1992","unstructured":"Melissaratos, E.A., Souvaine, D.L.: Shortest paths help solve geometric optimization problems in planar regions. SIAM J. Comput. 21(4), 601\u2013638 (1992)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"12_CR21","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1142\/S0218195996000216","volume":"6","author":"JSB Mitchell","year":"1996","unstructured":"Mitchell, J.S.B.: Shortest paths among obstacles in the plane. Int. J. Comput. Geom. Appl. 6(3), 309\u2013332 (1996)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"2","key":"12_CR22","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0020-0190(86)90045-1","volume":"23","author":"H Rohnert","year":"1986","unstructured":"Rohnert, H.: Shortest paths in the plane with convex polygonal obstacles. Inf. Process. Lett. 23(2), 71\u201376 (1986)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"12_CR23","doi-asserted-by":"publisher","first-page":"982","DOI":"10.1145\/185675.185795","volume":"41","author":"JA Storer","year":"1994","unstructured":"Storer, J.A., Reif, J.H.: Shortest paths in the plane with polygonal obstacles. J. ACM 41(5), 982\u20131012 (1994)","journal-title":"J. ACM"}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T02:31:53Z","timestamp":1775269913000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04651-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046507","9783030046514"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04651-4_12","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"}}]}}