{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:12Z","timestamp":1740122412061,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,4,9]],"date-time":"2021-04-09T00:00:00Z","timestamp":1617926400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,9]],"date-time":"2021-04-09T00:00:00Z","timestamp":1617926400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100007601","name":"Horizon 2020","doi-asserted-by":"publisher","award":["H2020-MSCA-RISE project 734922 - CONNECT","H2020-MSCA-RISE project 734922 - CONNECT"],"award-info":[{"award-number":["H2020-MSCA-RISE project 734922 - CONNECT","H2020-MSCA-RISE project 734922 - CONNECT"]}],"id":[{"id":"10.13039\/501100007601","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004837","name":"Spanish Ministry of Science and Innovation","doi-asserted-by":"crossref","award":["PID2019-104129GB-I00","PID2019-104129GB-I00"],"award-info":[{"award-number":["PID2019-104129GB-I00","PID2019-104129GB-I00"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004837","name":"Spanish Ministry of Science and Innovation","doi-asserted-by":"crossref","award":["PID2019-104129GB-I00"],"award-info":[{"award-number":["PID2019-104129GB-I00"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Science Centre, Poland","award":["2015\/17\/B\/ST6\/01887"],"award-info":[{"award-number":["2015\/17\/B\/ST6\/01887"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s10898-021-01020-3","type":"journal-article","created":{"date-parts":[[2021,4,9]],"date-time":"2021-04-09T04:02:42Z","timestamp":1617940962000},"page":"887-920","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimizing generalized kernels of polygons"],"prefix":"10.1007","volume":"80","author":[{"given":"Alejandra","family":"Martinez-Moraian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5403-8467","authenticated-orcid":false,"given":"David","family":"Orden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonidas","family":"Palios","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Seara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"\u017byli\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,9]]},"reference":[{"key":"1020_CR1","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/BF01459088","volume":"99","author":"W Ackermann","year":"1928","unstructured":"Ackermann, W.: Zum Hilbertschen Aufbau der reellen Zahlen. Math. Ann. 99, 118\u2013133 (1928)","journal-title":"Math. Ann."},{"key":"1020_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M de Berg","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications. Springer, Berlin (2008)"},{"issue":"7","key":"1020_CR3","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1016\/0031-3203(94)00158-I","volume":"28","author":"LP Gewali","year":"1995","unstructured":"Gewali, L.P.: Recognizing $$s$$-star polygons. Pattern Recogn. 28(7), 1019\u20131032 (1995)","journal-title":"Pattern Recogn."},{"issue":"4","key":"1020_CR4","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0020-0190(89)90136-1","volume":"33","author":"J Hershberger","year":"1989","unstructured":"Hershberger, J.: Finding the upper envelope of $$n$$ line segments in $$O(n\\log n)$$ time. Inf. Process. Lett. 33(4), 169\u2013174 (1989)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"1020_CR5","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s10846-018-0951-0","volume":"95","author":"G Huski\u0107","year":"2019","unstructured":"Huski\u0107, G., Buck, S., Zell, A.: GeRoNa: generic robot navigation. J. Intell. Robot. Syst. 95(2), 419\u2013442 (2019)","journal-title":"J. Intell. Robot. Syst."},{"key":"1020_CR6","doi-asserted-by":"crossref","unstructured":"Icking, C., Klein, R.: Searching for the kernel of a polygon: a competitive strategy. In: Proceedings of the 11th Annual Symposium on Computational Geometry, pp. 258\u2013266 (1995)","DOI":"10.1145\/220279.220307"},{"key":"1020_CR7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-51542-9_12","volume":"382","author":"Y Ke","year":"1989","unstructured":"Ke, Y., O\u2019Rourke, J.: Computing the kernel of a point set in a polygon. Lecture Notes in Computer Science 382, 135\u2013146 (1989)","journal-title":"Lecture Notes in Computer Science"},{"key":"1020_CR8","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, D. G., Snoeyink, J.: Computing common tangents without a separating line. Proceedings of the 4th International Workshop on Algorithms and Data Structures, pp. 183\u2013193 (1995)","DOI":"10.1007\/3-540-60220-8_61"},{"issue":"3","key":"1020_CR9","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1145\/322139.322142","volume":"26","author":"DT Lee","year":"1979","unstructured":"Lee, D.T., Preparata, F.P.: An optimal algorithm for finding the kernel of a polygon. J. ACM 26(3), 415\u2013421 (1979)","journal-title":"J. ACM"},{"issue":"5","key":"1020_CR10","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0020-0190(79)90069-3","volume":"9","author":"D McCallum","year":"1979","unstructured":"McCallum, D., Avis, D.: A linear algorithm for finding the convex hull of a simple polygon. Inf. Process. Lett. 9(5), 201\u2013206 (1979). https:\/\/doi.org\/10.1016\/0020-0190(79)90069-3","journal-title":"Inf. Process. Lett."},{"key":"1020_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0020-0190(87)90086-X","volume":"25","author":"A Melkman","year":"1987","unstructured":"Melkman, A.: On-line construction of the convex hull of a simple polygon. Inf. Process. Lett. 25, 11\u201312 (1987)","journal-title":"Inf. Process. Lett."},{"key":"1020_CR12","unstructured":"Palios, L.: An output-sensitive algorithm for computing the $$s$$-kernel. 27th Canadian Conference on Computational Geometry, pp. 199\u2013204 (2015)"},{"key":"1020_CR13","first-page":"367","volume":"2000","author":"L Palios","year":"1851","unstructured":"Palios, L.: A new competitive strategy for reaching the kernel of an unknown polygon. Lecture Notes in Computer Science 2000, 367\u2013382 (1851)","journal-title":"Lecture Notes in Computer Science"},{"key":"1020_CR14","doi-asserted-by":"crossref","unstructured":"Schuierer, S., Rawlins, G. J. E., Wood, D.: A generalization of staircase visibility. 3rd Canadian Conference on Computational Geometry, pp. 96\u201399 (1991)","DOI":"10.1007\/3-540-54891-2_21"},{"key":"1020_CR15","unstructured":"Schuierer, S., Wood, D.: Generalized kernels of polygons with holes. 5th Canadian Conference on Computational Geometry, pp. 222\u2013227 (1993)"},{"key":"1020_CR16","unstructured":"Schuierer, S., Wood, D.: Multiple-guard kernels of simple polygons. Theoretical Computer Science Center Research Report HKUST-TCSC-98-06 (1998)"},{"key":"1020_CR17","unstructured":"Sugihara, K., Smith, J.: Genetic algorithms for adaptive motion planning of an autonomous mobile robot. Proceedings of the IEEE International Symposium on Computational Intelligence in Robotics and Automation, pp. 138\u2013143 (1997)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01020-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-021-01020-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01020-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,17]],"date-time":"2021-07-17T08:10:33Z","timestamp":1626509433000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-021-01020-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,9]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["1020"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-01020-3","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2021,4,9]]},"assertion":[{"value":"31 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}