{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:01:20Z","timestamp":1743058880730,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030835071"},{"type":"electronic","value":"9783030835088"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-83508-8_19","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"258-270","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Finding a Largest-Area Triangle in a Terrain in Near-Linear Time"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3183-4126","authenticated-orcid":false,"given":"Sergio","family":"Cabello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arun Kumar","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandip","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joydeep","family":"Mukherjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF01840359","volume":"2","author":"A Aggarwal","year":"1987","unstructured":"Aggarwal, A., Klawe, M., Moran, S., Shor, P., Wilber, R.: Geometric applications of a matrix-searching algorithm. Algorithmica 2, 195\u2013208 (1987)","journal-title":"Algorithmica"},{"key":"19_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.J., Overmars, M.H.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008)","edition":"3"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Boyce, J.E., Dobkin, D.P., Drysdale, III, R.L., Guibas, L.J.: Finding extremal polygons. In: STOC, pp. 282\u2013289. ACM (1982)","DOI":"10.1145\/800070.802202"},{"issue":"C","key":"19_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.comgeo.2015.08.001","volume":"51","author":"S Cabello","year":"2016","unstructured":"Cabello, S., Cheong, O., Knauer, C., Schlipf, L.: Finding largest rectangles in convex polygons. Comput. Geom. Theory Appl. 51(C), 67\u201374 (2016)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"5","key":"19_CR5","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1137\/16M1079695","volume":"46","author":"S Cabello","year":"2017","unstructured":"Cabello, S., Cibulka, J., Kyn\u010dl, 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":"19_CR6","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1142\/S0218195992000123","volume":"2","author":"S Chandran","year":"1992","unstructured":"Chandran, S., Mount, D.: A parallel algorithm for enclosed and enclosing triangles. Int. J. Comput. Geometry Appl. 2, 191\u2013214 (1992)","journal-title":"Int. J. Comput. Geometry Appl."},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF02187692","volume":"1","author":"JS Chang","year":"1986","unstructured":"Chang, J.S., Yap, C.K.: A polynomial solution for the potato-peeling problem. Discrete Comput. Geometry 1(2), 155\u2013182 (1986)","journal-title":"Discrete Comput. Geometry"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/BF01182771","volume":"11","author":"B Chazelle","year":"1994","unstructured":"Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M.: Algorithms for bichromatic line-segment problems polyhedral terrains. Algorithmica 11, 116\u2013132 (1994)","journal-title":"Algorithmica"},{"key":"19_CR9","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."},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Dobkin, D.P., Snyder, L.: On a general method for maximizing and minimizing among certain geometric problems. In: SFCS, pp. 9\u201317 (1979)","DOI":"10.1109\/SFCS.1979.28"},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/77635.77639","volume":"9","author":"H Edelsbrunner","year":"1990","unstructured":"Edelsbrunner, H., M\u00fccke, E.P.: Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graph. 9(1), 66\u2013104 (1990)","journal-title":"ACM Trans. Graph."},{"issue":"1","key":"19_CR12","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."},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"LJ Guibas","year":"1987","unstructured":"Guibas, L.J., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2, 209\u2013233 (1987)","journal-title":"Algorithmica"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Hall-Holt, O., Katz, M.J., Kumar, P., Mitchell, J.S.B., Sityon, A.: Finding large sticks and potatoes in polygons. In: SODA, pp. 474\u2013483 (2006)","DOI":"10.1145\/1109557.1109610"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"105943","DOI":"10.1016\/j.ipl.2020.105943","volume":"161","author":"I van der Hoog","year":"2020","unstructured":"van der Hoog, I., Keikha, V., L\u00f6ffler, M., Mohades, A., Urhausen, J.: Maximum-area triangle in a convex polygon, revisited. Inf. Process. Lett. 161, 105943 (2020)","journal-title":"Inf. Process. Lett."},{"key":"19_CR16","unstructured":"Kallus, Y.: A linear-time algorithm for the maximum-area inscribed triangle in a convex polygon (2017, preprint). https:\/\/arxiv.org\/abs\/1706.03049"},{"issue":"4","key":"19_CR17","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/0221038","volume":"21","author":"E Melissaratos","year":"1992","unstructured":"Melissaratos, E., Souvaine, D.: Shortest paths help solve geometric optimization problems in planar regions. SIAM J. Comput. 21(4), 601\u2013638 (1992)","journal-title":"SIAM J. Comput."},{"key":"19_CR18","unstructured":"Rote, G.: The largest contained quadrilateral and the smallest enclosing parallelogram of a convex polygon (2019, preprint). https:\/\/arxiv.org\/abs\/1905.11203"},{"key":"19_CR19","volume-title":"Handbook of Discrete and Computational Geometry","author":"CD Toth","year":"2017","unstructured":"Toth, C.D., O\u2019Rourke, J., Goodman, J.E.: Handbook of Discrete and Computational Geometry. CRC Press, Boca Raton (2017)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-83508-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T11:27:09Z","timestamp":1645183629000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/projects.cs.dal.ca\/wads2021\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"123","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":"47","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":"0","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":"38% - 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.1","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":"13","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)"}}]}}