{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:06:35Z","timestamp":1742972795773,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319623948"},{"type":"electronic","value":"9783319623955"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-62395-5_35","type":"book-chapter","created":{"date-parts":[[2017,7,6]],"date-time":"2017-07-06T00:52:59Z","timestamp":1499302379000},"page":"509-524","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon"],"prefix":"10.1007","author":[{"given":"Sanjib","family":"Sadhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sasanka","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soumen","family":"Nandi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhas C.","family":"Nandy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suchismita","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,7]]},"reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF01840359","volume":"2","author":"A Aggarwal","year":"1987","unstructured":"Aggarwal, A., Klawe, M.M., Moran, S., Shor, P.W., Wilber, R.E.: Geometric applications of a matrix-searching algorithm. Algorithmica 2, 195\u2013208 (1987)","journal-title":"Algorithmica"},{"key":"35_CR2","unstructured":"Alt, H., Hsu, D., Snoeyink, J.: Computing the largest inscribed isothetic rectangle. In: CCCG, pp. 67\u201372 (1995)"},{"issue":"1","key":"35_CR3","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1137\/0214011","volume":"14","author":"JE Boyce","year":"1985","unstructured":"Boyce, J.E., Dobkin, D.P., Drysdale III, R.L.S., Guibas, L.J.: Finding extremal polygons. SIAM J. Comput. 14(1), 134\u2013147 (1985)","journal-title":"SIAM J. Comput."},{"key":"35_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. 51, 67\u201374 (2016)","journal-title":"Comput. Geom."},{"issue":"3\/4","key":"35_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\/4), 281\u2013309 (1990)","journal-title":"J. Symb. Comput."},{"key":"35_CR6","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. Theor. Appl. 7, 125\u2013148 (1997)","journal-title":"Comput. Geom. Theor. Appl."},{"key":"35_CR7","unstructured":"DePano, A., Ke, Y., O\u2019Rourke, J.: Finding largest inscribed equilateral triangles and squares. In: 25th Allerton Conference on Communication, Control, and Computing, pp. 869\u2013878 (1987)"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Dobkin, D.P., Snyder, L.: On a general method for maximizing and minimizing among certain geometric problems (extended abstract). In: FOCS, pp. 9\u201317. IEEE Computer Society (1979)","DOI":"10.1109\/SFCS.1979.28"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Hall-Holt, O.A., 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":"35_CR10","unstructured":"Jin, K., Matulef, K.: Finding the maximum area parallelogram in a convex polygon. In: CCCG (2011)"},{"key":"35_CR11","unstructured":"Sadhu, S., Roy, S., Nandi, S., Maheshwari, A., Nandy, S.C.: Approximation algorithms for the two-center problem of convex polygon. CoRR abs\/1512.02356 (2015)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2017"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62395-5_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:57:45Z","timestamp":1710327465000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62395-5_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319623948","9783319623955"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62395-5_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"7 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trieste","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2017","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":"iccsa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}