{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:56:44Z","timestamp":1742986604328,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031236112"},{"type":"electronic","value":"9783031236129"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-23612-9_2","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:36:12Z","timestamp":1672540572000},"page":"31-45","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Rectangularization of\u00a0Digital Objects and\u00a0Its Relation with\u00a0Straight Skeletons"],"prefix":"10.1007","author":[{"given":"Anukul","family":"Maity","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mousumi","family":"Dutt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arindam","family":"Biswas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Abam, M.A., Aronov, B., De Berg, M., Khosravi, A.: Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons. In: Proceedings of the Twenty-Seventh Annual Symposium On Computational Geometry, SOCG 2011, pp. 407\u2013416. Association for Computing Machinery, New York (2011)","DOI":"10.1145\/1998196.1998263"},{"issue":"6","key":"2_CR2","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/0031-3203(81)90002-9","volume":"13","author":"D Avis","year":"1981","unstructured":"Avis, D., Toussaint, G.T.: An efficient algorithm for decomposing a polygon into star-shaped polygons. Pattern Recogn. 13(6), 395\u2013398 (1981)","journal-title":"Pattern Recogn."},{"key":"2_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"MD Berg","year":"2008","unstructured":"Berg, M.D., Cheong, O., Kreveld, M.V., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer-Verlag, Heidelberg (2008)","edition":"3"},{"issue":"4","key":"2_CR4","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0020-0190(94)90129-5","volume":"52","author":"MD Berg","year":"1994","unstructured":"Berg, M.D., Kreveld, M.V.: Rectilinear decompositions with low stabbing number. Inf. Process. Lett. 52(4), 215\u2013221 (1994)","journal-title":"Inf. Process. Lett."},{"key":"2_CR5","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). https:\/\/doi.org\/10.1007\/11499145_94"},{"issue":"4","key":"2_CR6","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. Commun. Image Represent. 21(4), 295\u2013310 (2010)","journal-title":"J. Vis. Commun. Image Represent."},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Chazelle, B.: A theorem on polygon cutting with applications. In: Proceedings of 23rd Annual Symposium on Foundations of Computer Science, pp. 339\u2013349. IEEE Computer Society (1982)","DOI":"10.1109\/SFCS.1982.58"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Chazelle, B., Dobkin, D.: Decomposing a polygon into its convex parts. In: Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, pp. 38\u201348. Association for Computing Machinery, New York (1979)","DOI":"10.1145\/800135.804396"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Culberson, J.C., Reckhow, R.A.: Covering polygons is hard. In: Proceedings of 29th Annual Symposium on Foundations of Computer Science, pp. 38\u201348. IEEE Computer Society (1988)","DOI":"10.1109\/SFCS.1988.21976"},{"key":"2_CR10","volume-title":"Discrete and Computational Geometry","author":"SL Devadoss","year":"2011","unstructured":"Devadoss, S.L., Rourke, J.O.: Discrete and Computational Geometry. Princeton University Press, Princeton (2011)"},{"issue":"4","key":"2_CR11","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1016\/j.cviu.2012.08.017","volume":"117","author":"M Dutt","year":"2013","unstructured":"Dutt, M., Biswas, A., Bhowmick, P.: Approximate partitioning of 2D objects into orthogonally convex components. Comput. Vis. Image Underst. 117(4), 326\u2013341 (2013)","journal-title":"Comput. Vis. Image Underst."},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s00454-008-9114-6","volume":"40","author":"S Fekete","year":"2008","unstructured":"Fekete, S., L\u00fcbbecke, M., Meijer, H.: Minimizing the stabbing number of matchings, trees, and triangulations. Discret. Comput. Geom. 40, 595\u2013621 (2008). https:\/\/doi.org\/10.1007\/s00454-008-9114-6","journal-title":"Discret. Comput. Geom."},{"issue":"4","key":"2_CR13","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(78)90062-5","volume":"7","author":"M Garey","year":"1978","unstructured":"Garey, M., Johnson, D., Preparata, F., Tarjan, R.: Triangulating a simple polygon. Inf. Process. Lett. 7(4), 175\u2013179 (1978)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"2_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1109\/MCG.1983.262975","volume":"3","author":"K Gourley","year":"1983","unstructured":"Gourley, K., Green, D.: A polygon-to-rectangle conversion algorithm. IEEE Comput. Graph. Appl. 3(1), 31\u201336 (1983)","journal-title":"IEEE Comput. Graph. Appl."},{"issue":"4","key":"2_CR15","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1137\/0214056","volume":"14","author":"JM Keil","year":"1985","unstructured":"Keil, J.M.: Decomposing a polygon into simpler components. SIAM J. Comput. 14(4), 799\u2013817 (1985)","journal-title":"SIAM J. Comput."},{"key":"2_CR16","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)"},{"issue":"1","key":"2_CR17","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.comgeo.2005.10.005","volume":"35","author":"JM Lien","year":"2006","unstructured":"Lien, J.M., Amato, N.M.: Approximate convex decomposition of polygons. Comput. Geom. Theory Appl. 35(1), 100\u2013123 (2006)","journal-title":"Comput. Geom. Theory Appl."},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BFb0012784","volume-title":"Automata, Languages and Programming","author":"A Lingas","year":"1982","unstructured":"Lingas, A.: The power of non-rectilinear holes. In: Nielsen, M., Schmidt, E.M. (eds.) Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 140, pp. 369\u2013383. Lecture Notes in Computer Science (LNCS), Springer, Cham (1982). https:\/\/doi.org\/10.1007\/BFb0012784"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BFb0009508","volume-title":"Algorithms and Computation","author":"A Lingas","year":"1996","unstructured":"Lingas, A., Soltan, V.: Minimum convex partition of a polygon with holes by cuts in given directions. In: Asano, T., Igarashi, Y., Nagamochi, H., Miyano, S., Suri, S. (eds.) Algorithms and Computation. Lecture Notes in Computer Science, pp. 315\u2013325. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0009508"},{"issue":"3","key":"2_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2886097","volume":"21","author":"C Liu","year":"2016","unstructured":"Liu, C., et al.: An effective chemical mechanical polishing fill insertion approach. ACM Trans. Des. Autom. Electron. Syst. 21(3), 1\u201321 (2016)","journal-title":"ACM Trans. Des. Autom. Electron. Syst."},{"issue":"3","key":"2_CR21","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1145\/234860.234865","volume":"1","author":"MA Lopez","year":"1996","unstructured":"Lopez, M.A., Mehta, D.P.: Efficient decomposition of polygons into L-shapes with application to VLSI layouts. ACM Trans. Des. Autom. Electron. Syst. 1(3), 371\u2013395 (1996)","journal-title":"ACM Trans. Des. Autom. Electron. Syst."},{"issue":"5","key":"2_CR22","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.3758\/s13414-017-1457-8","volume":"80","author":"AS Lowet","year":"2018","unstructured":"Lowet, A.S., Firestone, C., Scholl, B.J.: Seeing structure: shape skeletons modulate perceived similarity. Atten. Percept. Psychophys. 80(5), 1278\u20131289 (2018). https:\/\/doi.org\/10.3758\/s13414-017-1457-8","journal-title":"Atten. Percept. Psychophys."},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Lubiw, A.: Decomposing polygonal regions into convex quadrilaterals. In: Proceedings of the First Annual Symposium on Computational Geometry, pp. 97\u2013106. Association for Computing Machinery, New York (1985)","DOI":"10.1145\/323233.323247"},{"issue":"2","key":"2_CR24","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/TIT.1983.1056648","volume":"29","author":"JO Rourke","year":"1983","unstructured":"Rourke, J.O., Supowit, K.J.: Some NP-hard polygon decomposition problems. IEEE Trans. Inf. Theory 29(2), 181\u2013190 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"2_CR25","doi-asserted-by":"publisher","first-page":"1078","DOI":"10.1109\/TC.1978.1675001","volume":"27","author":"B Schachter","year":"1978","unstructured":"Schachter, B.: Decomposition of polygons into convex sets. IEEE Trans. Comput. 27(11), 1078\u20131082 (1978)","journal-title":"IEEE Trans. Comput."},{"issue":"12","key":"2_CR26","doi-asserted-by":"publisher","first-page":"4279","DOI":"10.1016\/j.patcog.2012.05.012","volume":"45","author":"T Suk","year":"2012","unstructured":"Suk, T., H\u00f6schl, C., Flusser, J.: Decomposition of binary images- a survey and comparison. Pattern Recogn. 45(12), 4279\u20134291 (2012)","journal-title":"Pattern Recogn."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Image Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23612-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T03:33:42Z","timestamp":1672544022000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23612-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031236112","9783031236129"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23612-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWCIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Image Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Messina","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcia2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iwcia2022.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"24","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":"20","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":"83% - 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":"4","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)"}}]}}