{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:16:12Z","timestamp":1743038172807,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031221040"},{"type":"electronic","value":"9783031221057"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22105-7_5","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"49-60","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Large k-Gons in\u00a0a\u00a01.5D Terrain"],"prefix":"10.1007","author":[{"given":"Vahideh","family":"Keikha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/BFb0032068","volume-title":"Automata, Languages and Programming","author":"H Alt","year":"1990","unstructured":"Alt, H., Bl\u00f6mer, J., Wagener, H.: Approximation of convex polygons. In: Paterson, M.S. (ed.) ICALP 1990. LNCS, vol. 443, pp. 703\u2013716. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0032068"},{"issue":"5","key":"5_CR2","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)","journal-title":"SIAM J. Comput."},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-030-83508-8_19","volume-title":"Algorithms and Data Structures","author":"S Cabello","year":"2021","unstructured":"Cabello, S., Das, A.K., Das, S., Mukherjee, J.: Finding a largest-area triangle in a terrain in near-linear time. In: Lubiw, A., Salavatipour, M. (eds.) WADS 2021. LNCS, vol. 12808, pp. 258\u2013270. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-83508-8_19"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF02187692","volume":"1","author":"J Chang","year":"1986","unstructured":"Chang, J., Yap, C.: A polynomial solution for the potato-peeling problem. Discret. Comput. Geom. 1, 155\u2013182 (1986)","journal-title":"Discret. Comput. Geom."},{"issue":"3\u20134","key":"5_CR5","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0747-7171(08)80065-X","volume":"10","author":"B Chazelle","year":"1990","unstructured":"Chazelle, B., Sharir, M.: An algorithm for generalized point location and its applications. J. Symb. Comput. 10(3\u20134), 281\u2013309 (1990)","journal-title":"J. Symb. Comput."},{"key":"5_CR6","unstructured":"Daniels, K., Milenkovic, V., Roth, D.: Finding the largest rectangle in several classes of polygons. Harvard Computer Science Group, Technical Report TR-22-95 (1995)"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0925-7721(95)00041-0","volume":"7","author":"KL Daniels","year":"1997","unstructured":"Daniels, K.L., Milenkovic, V.J., Roth, D.: Finding the largest area axis-parallel rectangle in a polygon. Comput. Geom. 7, 125\u2013148 (1997)","journal-title":"Comput. Geom."},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.tcs.2020.12.018","volume":"858","author":"AK Das","year":"2021","unstructured":"Das, A.K., Das, S., Mukherjee, J.: Largest triangle inside a terrain. Theoret. Comput. Sci. 858, 90\u201399 (2021)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"5_CR9","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)","journal-title":"Geom. Dedicata."},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L Guibas","year":"1987","unstructured":"Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2(1), 209\u2013233 (1987)","journal-title":"Algorithmica"},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/0022-0000(89)90041-X","volume":"39","author":"LJ Guibas","year":"1989","unstructured":"Guibas, L.J., Hershberger, J.: Optimal shortest path queries in a simple polygon. J. Comput. Syst. Sci. 39(2), 126\u2013152 (1989)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Hall-Holt, O., Katz, M.J., Kumar, P., Mitchell, J.S., Sityon, A.: Finding large sticks and potatoes in polygons. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, vol. 6, pp. 474\u2013483 (2006)","DOI":"10.1145\/1109557.1109610"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-319-39441-1_17","volume-title":"Computational Topology in Image Context","author":"N Karmakar","year":"2016","unstructured":"Karmakar, N., Biswas, A.: Construction of an approximate 3D orthogonal convex skull. In: Bac, A., Mari, J.-L. (eds.) CTIC 2016. LNCS, vol. 9667, pp. 180\u2013192. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39441-1_17"},{"key":"5_CR14","unstructured":"Lin, M., Gottschalk, S.: Collision detection between geometric models: a survey. In: Proceedings of IMA Conference on Mathematics of Surfaces, vol. 1, pp. 602\u2013608. Citeseer (1998)"},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00453-008-9174-2","volume":"56","author":"M L\u00f6ffler","year":"2010","unstructured":"L\u00f6ffler, M., van Kreveld, M.: Largest and smallest convex hulls for imprecise points. Algorithmica 56(2), 235\u2013269 (2010)","journal-title":"Algorithmica"},{"issue":"3","key":"5_CR16","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/38.920624","volume":"21","author":"DP Luebke","year":"2001","unstructured":"Luebke, D.P.: A developer\u2019s survey of polygonal simplification algorithms. IEEE Comput. Graph. Appl. 21(3), 24\u201335 (2001)","journal-title":"IEEE Comput. Graph. Appl."},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Melissaratos, E.A., Souvaine, D.L.: On solving geometric optimization problems using shortest paths. In: Proceedings of the Sixth Annual Symposium on Computational Geometry, Berkeley, pp. 350\u2013359. ACM (1990)","DOI":"10.1145\/98524.98600"},{"key":"5_CR18","unstructured":"Woo, T.C.: The convex skull problem. Technical report, Technical report TR 86\u201331, Department of Industrial and Operations (1986)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22105-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T22:03:38Z","timestamp":1680213818000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22105-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221040","9783031221057"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22105-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"101","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}