{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:58:34Z","timestamp":1761663514950,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319394404"},{"type":"electronic","value":"9783319394411"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","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":[[2016]]},"DOI":"10.1007\/978-3-319-39441-1_15","type":"book-chapter","created":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T07:47:40Z","timestamp":1464767260000},"page":"157-169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Finding Largest Rectangle Inside a Digital Object"],"prefix":"10.1007","author":[{"given":"Apurba","family":"Sarkar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arindam","family":"Biswas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mousumi","family":"Dutt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnab","family":"Bhattacharya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,2]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, A., Suri, S.: Fast algorithms for computing the largest empty rectangle. In: Proceedings of the 3rd Annual Symposium on Computational Geometry, pp. 278\u2013290 (1987)","DOI":"10.1145\/41958.41988"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1007\/11499145_94","volume-title":"Image Analysis","author":"A Biswas","year":"2005","unstructured":"Biswas, A., Bhowmick, P., Bhattacharya, B.B.: TIPS: on finding a tight isothetic polygonal shape covering a 2D object. In: Kalviainen, H., Parkkinen, J., Kaarna, A. (eds.) SCIA 2005. LNCS, vol. 3540, pp. 930\u2013939. Springer, Heidelberg (2005)"},{"issue":"4","key":"15_CR3","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.jvcir.2010.02.001","volume":"21","author":"A Biswas","year":"2010","unstructured":"Biswas, A., Bhowmick, P., Bhattacharya, B.B.: Construction of isothetic covers of a digital object: A combinatorial approach. J. Vis. Comun. Image Represent. 21(4), 295\u2013310 (2010)","journal-title":"J. Vis. Comun. Image Represent."},{"key":"15_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. Discrete Comput. Geom. 1, 155\u2013182 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"15_CR5","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/3-540-12920-0_4","volume-title":"STACS 84","author":"B. Chazelle","year":"1984","unstructured":"Chazelle, B., Drysdale, R.L., Lee, D.T.: Computing the largest empty rectangle. In: STACS-1984, pp. 43\u201354. Springer, Heidelberg (1984)"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0215022","volume":"15","author":"B Chazelle","year":"1986","unstructured":"Chazelle, B., III, R.D., Lee, D.: Computing the largest empty rectangle. SIAM J. Comput. 15, 300\u2013315 (1986)","journal-title":"SIAM J. Comput."},{"key":"15_CR7","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.: Theor. Appl. 7, 125\u2013148 (1997)","journal-title":"Comput. Geom.: Theor. Appl."},{"key":"15_CR8","volume-title":"Digital Geometry: Geometric Methods for Digital Picture Analysis","author":"R Klette","year":"2004","unstructured":"Klette, R., Rosenfeld, A.: Digital Geometry: Geometric Methods for Digital Picture Analysis. Morgan Kaufmann, San Francisco (2004)"},{"key":"15_CR9","unstructured":"McKenna, M., O\u2019Rourke, J., Suri, S.: Finding the largest rectangle in an orthogonal polygon. In: Proceedings of the 23rd Allerton Conference on Communication, Control and Computing, pp. 486\u2013495 (1985)"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-53487-3_50","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"SC Nandy","year":"1990","unstructured":"Nandy, S.C., Bhattacharya, B.B., Ray, S.: Efficient algorithms for identifying all maximal isothetic empty rectangles in VLSI layout design. In: Nori, K.V., Veni Madhavan, C.E. (eds.) Foundations of Software Technology and Theoretical Computer Science. LNCS, vol. 472, pp. 255\u2013269. Springer, Heidelberg (1990)"},{"key":"15_CR11","series-title":"Computational Aspects of VLSI","volume-title":"Chap. 9: Algorithms for VLSI Design Tools","author":"J Ullman","year":"1984","unstructured":"Ullman, J.: Chap. 9: Algorithms for VLSI Design Tools. Computational Aspects of VLSI. Computer Science Press, Rockville (1984)"}],"container-title":["Lecture Notes in Computer Science","Computational Topology in Image Context"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39441-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:08:57Z","timestamp":1590970137000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39441-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319394404","9783319394411"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39441-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"2 June 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}