{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:04:58Z","timestamp":1740107098732,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2023,12,7]],"date-time":"2023-12-07T00:00:00Z","timestamp":1701907200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,7]],"date-time":"2023-12-07T00:00:00Z","timestamp":1701907200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Vis Comput"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s00371-023-03170-9","type":"journal-article","created":{"date-parts":[[2023,12,7]],"date-time":"2023-12-07T16:02:04Z","timestamp":1701964924000},"page":"6369-6387","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Obtaining the user-defined polygons inside a closed contour with holes"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5410-6589","authenticated-orcid":false,"given":"R.","family":"Molano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4584-6945","authenticated-orcid":false,"given":"J. C.","family":"Sancho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8717-442X","authenticated-orcid":false,"given":"M. M.","family":"\u00c1vila","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8168-7892","authenticated-orcid":false,"given":"P. G.","family":"Rodr\u00edguez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6367-2694","authenticated-orcid":false,"given":"A.","family":"Caro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,7]]},"reference":[{"key":"3170_CR1","doi-asserted-by":"publisher","unstructured":"Girard, N., Smirnov, D., Solomon, J., Tarabalka, Y.: Polygonal building extraction by frame field learning. In: 2021 IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 5887\u20135896. https:\/\/doi.org\/10.1109\/CVPR46437.2021.00583 (2021)","DOI":"10.1109\/CVPR46437.2021.00583"},{"issue":"2","key":"3170_CR2","doi-asserted-by":"publisher","first-page":"5063","DOI":"10.1109\/LRA.2022.3154052","volume":"7","author":"Z Xu","year":"2022","unstructured":"Xu, Z., Liu, Y., Gan, L., Hu, X., Sun, Y., Liu, M., Wang, L.: csboundary: city-scale road-boundary detection in aerial images for high-definition maps. IEEE Robot. Autom. Lett. 7(2), 5063\u20135070 (2022). https:\/\/doi.org\/10.1109\/LRA.2022.3154052","journal-title":"IEEE Robot. Autom. Lett."},{"key":"3170_CR3","unstructured":"Bast, H., Hert, S.: The area partitioning problem. https:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.29.7473 (2000)"},{"issue":"3","key":"3170_CR4","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/s10878-021-00705-5","volume":"41","author":"Q Wei","year":"2021","unstructured":"Wei, Q., Sun, J., Tan, X., Yao, X., Ren, Y.: The simple grid polygon exploration problem. J. Comb. Optim. 41(3), 625\u2013639 (2021). https:\/\/doi.org\/10.1007\/s10878-021-00705-5","journal-title":"J. Comb. Optim."},{"issue":"5","key":"3170_CR5","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1007\/s00371-020-01845-1","volume":"37","author":"H Ali","year":"2021","unstructured":"Ali, H., Faisal, S., Chen, K., Rada, L.: Image-selective segmentation model for multi-regions within the object of interest with application to medical disease. Vis. Comput. 37(5), 939\u2013955 (2021). https:\/\/doi.org\/10.1007\/s00371-020-01845-1","journal-title":"Vis. Comput."},{"issue":"5","key":"3170_CR6","doi-asserted-by":"publisher","first-page":"4037","DOI":"10.1049\/iet-ipr.2017.0509","volume":"11","author":"IA Qasmieh","year":"2021","unstructured":"Qasmieh, I.A., Alquran, H., Alqudah, A.M.: Occluded iris classification and segmentation using self-customized artificial intelligence models and iterative randomized hough transform. Int. J. Electr. Comput. Eng. 11(5), 4037 (2021). https:\/\/doi.org\/10.1049\/iet-ipr.2017.0509","journal-title":"Int. J. Electr. Comput. Eng."},{"key":"3170_CR7","doi-asserted-by":"publisher","unstructured":"Gibert, G., D\u2019Alessandro, D., Lance, F.: Face detection method based on photoplethysmography. In: 2013 10th IEEE International Conference on Advanced Video and Signal Based Surveillance, pp. 449\u2013453. https:\/\/doi.org\/10.1109\/AVSS.2013.6636681 (2013)","DOI":"10.1109\/AVSS.2013.6636681"},{"issue":"1","key":"3170_CR8","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.compag.2013.08.014","volume":"98","author":"T Oksanen","year":"2013","unstructured":"Oksanen, T.: Shape-describing indices for agricultural field plots and their relationship to operational efficiency. Comput. Electron. Agric. 98(1), 252\u2013259 (2013). https:\/\/doi.org\/10.1016\/j.compag.2013.08.014","journal-title":"Comput. Electron. Agric."},{"key":"3170_CR9","doi-asserted-by":"publisher","DOI":"10.3389\/fpls.2020.511768","volume":"11","author":"SL Anderson","year":"2020","unstructured":"Anderson, S.L., Murray, S.C.: R\/uastools: plotshpcreate: create multi-polygon shapefiles for extraction of research plot scale agriculture remote sensing data. Front. Plant Sci. 11, 511768 (2020). https:\/\/doi.org\/10.3389\/fpls.2020.511768","journal-title":"Front. Plant Sci."},{"key":"3170_CR10","unstructured":"Ministry of Farming, Fishing and Food of Spain. https:\/\/www.mapa.gob.es\/es\/cartografia-y-sig (2023)"},{"key":"3170_CR11","unstructured":"Visor SigPac v4.8. https:\/\/sigpac.mapa.gob.es\/fega\/visor (2023)"},{"key":"3170_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2021.101792","volume":"98","author":"S Lee","year":"2021","unstructured":"Lee, S., Eom, T., Ahn, H.-K.: Largest triangles in a polygon. Comput. Geom. 98, 101792 (2021). https:\/\/doi.org\/10.1016\/j.comgeo.2021.101792","journal-title":"Comput. Geom."},{"key":"3170_CR13","unstructured":"Kallus, Y.: A linear-time algorithm for the maximum-area inscribed triangle in a convex polygon. arXiv:1706.03049 (2017)"},{"issue":"4","key":"3170_CR14","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). https:\/\/doi.org\/10.1137\/0221038","journal-title":"SIAM J. Comput."},{"key":"3170_CR15","unstructured":"Alt, H., Hsu, D., Snoeyink, J.: Computing the largest inscribed isothetic rectangle. In: CCCG, pp. 67\u201372. https:\/\/www.cs.ubc.ca\/sites\/default\/files\/tr\/1994\/TR-94-28_0.pdf (1995)"},{"key":"3170_CR16","unstructured":"Boland, R.P., Urrutia, J.: Finding the largest axis-aligned rectangle in a polygon in... In: Proceedings of the 13th the Canadian Conference on Computational Geometry. http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.20.7210 (2001)"},{"issue":"1\u20132","key":"3170_CR17","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0925-7721(95)00041-0","volume":"7","author":"K Daniels","year":"1997","unstructured":"Daniels, K., Milenkovic, V., Roth, D.: Finding the largest area axis-parallel rectangle in a polygon. Comput. Geom. 7(1\u20132), 125\u2013148 (1997). https:\/\/doi.org\/10.1016\/0925-7721(95)00041-0","journal-title":"Comput. Geom."},{"key":"3170_CR18","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.jda.2012.01.002","volume":"13","author":"C Knauer","year":"2012","unstructured":"Knauer, C., Schlipf, L., Schmidt, J.M., Tiwary, H.R.: Largest inscribed rectangles in convex polygons. J. Discrete Algorithms 13, 78\u201385 (2012). https:\/\/doi.org\/10.1016\/j.jda.2012.01.002","journal-title":"J. Discrete Algorithms"},{"issue":"19","key":"3170_CR19","doi-asserted-by":"publisher","first-page":"9866","DOI":"10.1016\/j.amc.2012.03.063","volume":"218","author":"R Molano","year":"2012","unstructured":"Molano, R., Rodr\u00edguez, P.G., Caro, A., Dur\u00e1n, M.L.: Finding the largest area rectangle of arbitrary orientation in a closed contour. Appl. Math. Comput. 218(19), 9866\u20139874 (2012). https:\/\/doi.org\/10.1016\/j.amc.2012.03.063","journal-title":"Appl. Math. Comput."},{"key":"3170_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2020.101710","volume":"94","author":"Y Choi","year":"2021","unstructured":"Choi, Y., Lee, S., Ahn, H.-K.: Maximum-area and maximum-perimeter rectangles in polygons. Comput. Geom. 94, 101710 (2021). https:\/\/doi.org\/10.1016\/j.comgeo.2020.101710","journal-title":"Comput. Geom."},{"key":"3170_CR21","unstructured":"Jin, K.: Maximal parallelograms in convex polygons. arXiv:1512.03897376. https:\/\/iiis.tsinghua.edu.cn\/uploadfile\/2015\/0605\/20150605101629915.pdf (2015)"},{"key":"3170_CR22","doi-asserted-by":"publisher","first-page":"103600","DOI":"10.1109\/ACCESS.2021.3098234","volume":"9","author":"R Molano","year":"2021","unstructured":"Molano, R., Caballero, D., Rodr\u00edguez, P.G., \u00c1vila, M.D.M., Torres, J.P., Dur\u00e1n, M.L., Sancho, J.C., Caro, A.: Finding the largest volume parallelepipedon of arbitrary orientation in a solid. IEEE Access 9, 103600\u2013103609 (2021). https:\/\/doi.org\/10.1109\/ACCESS.2021.3098234","journal-title":"IEEE Access"},{"key":"3170_CR23","unstructured":"Keikha, V.: Linear-time algorithms for largest inscribed quadrilateral. https:\/\/invenio.nusl.cz\/record\/432419 (2020)"},{"key":"3170_CR24","unstructured":"Rote, G.: The largest quadrilateral in a convex polygon. arXiv:1905.11203381. arXiv:1905.11203v2 (2019)"},{"issue":"1","key":"3170_CR25","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF00183192","volume":"11","author":"JE Goodman","year":"1981","unstructured":"Goodman, J.E.: On the largest convex polygon contained in a non-convex n-gon, or how to peel a potato. Geom. Dedicata. 11(1), 99\u2013106 (1981). https:\/\/doi.org\/10.1007\/BF00183192","journal-title":"Geom. Dedicata."},{"issue":"2","key":"3170_CR26","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF02187692","volume":"1","author":"J-S Chang","year":"1986","unstructured":"Chang, J.-S., Yap, C.-K.: A polynomial solution for the potato-peeling problem. Discrete Comput. Geom. 1(2), 155\u2013182 (1986). https:\/\/doi.org\/10.1007\/BF02187692","journal-title":"Discrete Comput. Geom."},{"issue":"5","key":"3170_CR27","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1137\/16M1079695","volume":"46","author":"S Cabello","year":"2017","unstructured":"Cabello, S., Cibulka, J., Kyncl, J., Saumell, M., Valtr, P.: Peeling potatoes near-optimally in near-linear time. SIAM J. Comput. 46(5), 1574\u20131602 (2017). https:\/\/doi.org\/10.1137\/16M1079695","journal-title":"SIAM J. Comput."},{"key":"3170_CR28","unstructured":"Media Engineering Group (GIM): Source code, Scripts, and Documentation. https:\/\/github.com\/UniversidadExtremadura\/user-defined-polygons-inside-a-contour. Accessed 2023\/02\/20 (2023)"},{"issue":"8","key":"3170_CR29","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1080\/00029890.1985.11971689","volume":"92","author":"DE Varberg","year":"1985","unstructured":"Varberg, D.E.: Pick\u2019s theorem revisited. Am. Math. Mon. 92(8), 584\u2013587 (1985). https:\/\/doi.org\/10.1080\/00029890.1985.11971689","journal-title":"Am. Math. Mon."},{"key":"3170_CR30","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms, third. New York (2009)"},{"issue":"7","key":"3170_CR31","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1145\/360881.360919","volume":"18","author":"H Freeman","year":"1975","unstructured":"Freeman, H., Shapira, R.: Determining the minimum-area encasing rectangle for an arbitrary closed curve. Commun. ACM 18(7), 409\u2013413 (1975). https:\/\/doi.org\/10.1145\/360881.360919","journal-title":"Commun. ACM"}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-023-03170-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00371-023-03170-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-023-03170-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T15:17:34Z","timestamp":1723562254000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00371-023-03170-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,7]]},"references-count":31,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["3170"],"URL":"https:\/\/doi.org\/10.1007\/s00371-023-03170-9","relation":{},"ISSN":["0178-2789","1432-2315"],"issn-type":[{"type":"print","value":"0178-2789"},{"type":"electronic","value":"1432-2315"}],"subject":[],"published":{"date-parts":[[2023,12,7]]},"assertion":[{"value":"9 September 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}