{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:32:11Z","timestamp":1742931131720,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046507"},{"type":"electronic","value":"9783030046514"}],"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_34","type":"book-chapter","created":{"date-parts":[[2018,11,15]],"date-time":"2018-11-15T19:56:50Z","timestamp":1542311810000},"page":"509-521","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Does a Robot Path Have Clearance C?"],"prefix":"10.1007","author":[{"given":"Ovidiu","family":"Daescu","sequence":"first","affiliation":[]},{"given":"Hemant","family":"Malik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,16]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., van Kreveld, M., Overmars, M.: Intersection queries for curved objects. In: Proceedings of the seventh annual symposium on Computational geometry, pp. 41\u201350. ACM (1991)","DOI":"10.1145\/109648.109653"},{"issue":"3","key":"34_CR2","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1006\/jagm.1996.0056","volume":"21","author":"PK Agarwal","year":"1996","unstructured":"Agarwal, P.K., Sharir, M.: Ray shooting amidst convex polygons in 2D. J. Algorithms 21(3), 508\u2013519 (1996)","journal-title":"J. Algorithms"},{"issue":"05","key":"34_CR3","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1142\/S0218195903001268","volume":"13","author":"S Bespamyatnikh","year":"2003","unstructured":"Bespamyatnikh, S.: Computing closest points for segments. Int. J. Comput. Geom. Appl. 13(05), 419\u2013438 (2003)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"34_CR4","unstructured":"Bespamyatnikh, S., Snoeyink, J.: Queries with segments in Voronoi diagrams. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 122\u2013129. Society for Industrial and Applied Mathematics (1999)"},{"issue":"1","key":"34_CR5","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/BF01377183","volume":"12","author":"B Chazelle","year":"1994","unstructured":"Chazelle, B., et al.: Ray shooting in polygons using geodesic triangulations. Algorithmica 12(1), 54\u201368 (1994)","journal-title":"Algorithmica"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Cole, R., Yap, C.K.: Geometric retrieval problems. In: 24th Annual Symposium on Foundations of Computer Science, pp. 112\u2013121. IEEE (1983)","DOI":"10.1109\/SFCS.1983.22"},{"issue":"3","key":"34_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.comgeo.2004.02.001","volume":"29","author":"PP Goswami","year":"2004","unstructured":"Goswami, P.P., Das, S., Nandy, S.C.: Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment. Comput. Geom. 29(3), 163\u2013175 (2004)","journal-title":"Comput. Geom."},{"issue":"1","key":"34_CR8","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":"34_CR9","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0020-0190(85)90015-8","volume":"21","author":"D Lee","year":"1985","unstructured":"Lee, D., Ching, Y., et al.: The power of geometric duality revisited. Info. Process. Lett. 21, 117\u2013122 (1985)","journal-title":"Info. Process. Lett."},{"issue":"3","key":"34_CR10","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF02293051","volume":"8","author":"J Matou\u0161ek","year":"1992","unstructured":"Matou\u0161ek, J.: Efficient partition trees. Discret. Comput. Geom. 8(3), 315\u2013334 (1992)","journal-title":"Discret. Comput. Geom."},{"issue":"2","key":"34_CR11","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02573972","volume":"10","author":"J Matou\u0161ek","year":"1993","unstructured":"Matou\u0161ek, J.: Range searching with efficient hierarchical cuttings. Discret. Comput. Geom. 10(2), 157\u2013182 (1993)","journal-title":"Discret. Comput. Geom."},{"issue":"03","key":"34_CR12","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1142\/S0218195996000216","volume":"6","author":"JS Mitchell","year":"1996","unstructured":"Mitchell, J.S.: Shortest paths among obstacles in the plane. Int. J. Comput. Geom. Appl. 6(03), 309\u2013332 (1996)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/B978-044482537-7\/50016-4","volume":"334","author":"JS Mitchell","year":"2000","unstructured":"Mitchell, J.S.: Geometric shortest paths and network optimization. Handb. Comput. Geom. 334, 633\u2013702 (2000)","journal-title":"Handb. Comput. Geom."},{"issue":"11","key":"34_CR14","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1016\/S0167-8655(98)00080-4","volume":"19","author":"P Mitra","year":"1998","unstructured":"Mitra, P., Chaudhuri, B.: Efficiently computing the closest point to a query line1. Pattern Recognit. Lett. 19(11), 1027\u20131035 (1998)","journal-title":"Pattern Recognit. Lett."},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Morimoto, T.K., Cerrolaza, J.J., Hsieh, M.H., Cleary, K., Okamura, A.M., Linguraru, M.G.: Design of patient-specific concentric tube robots using path planning from 3-D ultrasound. In: 2017 39th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC), pp. 165\u2013168. IEEE (2017)","DOI":"10.1109\/EMBC.2017.8036788"},{"issue":"12","key":"34_CR16","doi-asserted-by":"publisher","first-page":"1915","DOI":"10.1016\/S0167-8655(03)00018-7","volume":"24","author":"A Mukhopadhyay","year":"2003","unstructured":"Mukhopadhyay, A.: Using simplicial partitions to determine a closest point to a query line. Pattern Recognit. Lett. 24(12), 1915\u20131920 (2003)","journal-title":"Pattern Recognit. Lett."},{"issue":"1\u20133","key":"34_CR17","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.tcs.2007.11.015","volume":"393","author":"M Segal","year":"2008","unstructured":"Segal, M., Zeitlin, E.: Computing closest and farthest points for a query segment. Theor. Comput. Sci. 393(1\u20133), 294\u2013300 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"34_CR18","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 (JACM) 41(5), 982\u20131012 (1994)","journal-title":"J. ACM (JACM)"},{"issue":"11\u201312","key":"34_CR19","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1177\/0278364908097213","volume":"27","author":"R Wein","year":"2008","unstructured":"Wein, R., Van Den Berg, J., Halperin, D.: Planning high-quality paths and corridors amidst obstacles. Int. J. Robot. Res. 27(11\u201312), 1213\u20131231 (2008)","journal-title":"Int. J. Robot. Res."},{"key":"34_CR20","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.comgeo.2005.11.007","volume":"36","author":"R Weina","year":"2007","unstructured":"Weina, R., van den Bergb, J.P., Halperina, D.: The visibility-voronoi complex and its applications. Comput. Geom. 36, 66\u201387 (2007)","journal-title":"Comput. Geom."},{"issue":"4","key":"34_CR21","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02187890","volume":"2","author":"CK Yap","year":"1987","unstructured":"Yap, C.K.: Ano (n logn) algorithm for the voronoi diagram of a set of simple curve segments. Discret. Comput. Geom. 2(4), 365\u2013393 (1987)","journal-title":"Discret. Comput. Geom."}],"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_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:50:40Z","timestamp":1710345040000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04651-4_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046507","9783030046514"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04651-4_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}}]}}