{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:27:19Z","timestamp":1743118039983,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031781247"},{"type":"electronic","value":"9783031781254"}],"license":[{"start":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T00:00:00Z","timestamp":1733356800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T00:00:00Z","timestamp":1733356800000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-78125-4_18","type":"book-chapter","created":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T06:07:38Z","timestamp":1733292458000},"page":"253-269","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximate Cuboidization of\u00a0an\u00a0Orthogonal Polyhedron: A Combinatorial Approach"],"prefix":"10.1007","author":[{"given":"Anukul","family":"Maity","sequence":"first","affiliation":[]},{"given":"Mousumi","family":"Dutt","sequence":"additional","affiliation":[]},{"given":"Arindam","family":"Biswas","sequence":"additional","affiliation":[]},{"given":"Bhargab B.","family":"Bhattacharya","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,5]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.ipl.2018.11.008","volume":"143","author":"I Aldana-Galv\u00e1n","year":"2019","unstructured":"Aldana-Galv\u00e1n, I., \u00c1lvarez-Rebollar, J., Catana-Salazar, J., Jim\u00e9nez-Salinas, M., Sol\u00eds-Villarreal, E., Urrutia, J.: Minimizing the solid angle sum of orthogonal polyhedra. Inf. Process. Lett. 143, 47\u201350 (2019)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"18_CR2","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1137\/0221025","volume":"21","author":"CL Bajaj","year":"1992","unstructured":"Bajaj, C.L., Dey, T.K.: Convex decomposition of polyhedra and robustness. SIAM J. Comput. 21(2), 339\u2013364 (1992)","journal-title":"SIAM J. Comput."},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"Berg, M.D., Cheong, O., Kreveld, M.V., Overmars, M.: Computational Geometry: Algorithms and Applications. Springer-Verlag, Heidelberg, 3rd edn. (2008). https:\/\/doi.org\/10.1007\/978-3-540-77974-2","DOI":"10.1007\/978-3-540-77974-2"},{"issue":"4","key":"18_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":"18_CR5","doi-asserted-by":"publisher","unstructured":"Biedl, T., Derka, M., Irvine, V., Lubiw, A., Mondal, D., Turcotte, A.: Partitioning orthogonal histograms into rectangular boxes. In: Bender, M., Farach-Colton, M., Mosteiro, M. (eds.) Proceedings of the LATIN 2018: Theoretical Informatics, vol. 10807, pp. 146\u2013160. Springer International Publishing, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77404-6_12","DOI":"10.1007\/978-3-319-77404-6_12"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Chazelle, B.: Convex decompositions of polyhedra. In: Proceedings of the 13th Annual ACM Symposium on Theory of Computing, pp. 70\u201379. STOC\u201981, Association for Computing Machinery (1981)","DOI":"10.1145\/800076.802459"},{"key":"18_CR7","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. 601\u2013611. IEEE Computer Society, White Plains, NY, USA (1988)","DOI":"10.1109\/SFCS.1988.21976"},{"key":"18_CR8","first-page":"383","volume":"21","author":"\u0130 Demir","year":"2018","unstructured":"Demir, \u0130, Aliaga, D.G., Benes, B.: Near-convex decomposition and layering for efficient 3D printing. Addit. Manuf. 21, 383\u2013394 (2018)","journal-title":"Addit. Manuf."},{"key":"18_CR9","unstructured":"Devadoss, S.L., Rourke, J.O.: Discrete and Computational Geometry. Princeton University Press (2011)"},{"issue":"1","key":"18_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(91)90207-X","volume":"38","author":"VJ Dielissen","year":"1991","unstructured":"Dielissen, V.J., Kaldewaij, A.: Rectangular partition is polynomial in two dimensions but NP-complete in three. Inf. Process. Lett. 38(1), 1\u20136 (1991)","journal-title":"Inf. Process. Lett."},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.tcs.2017.05.035","volume":"689","author":"S Durocher","year":"2017","unstructured":"Durocher, S., Mehrabi, S.: Computing conforming partitions of orthogonal polygons with minimum stabbing number. Theoret. Comput. Sci. 689, 157\u2013168 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/978-3-642-19867-0_41","volume-title":"Proceeding of the 16th IAPR International Conference on Discrete Geometry for Computer Imagery, (DGCI)","author":"M Dutt","year":"2011","unstructured":"Dutt, M., Biswas, A., Bhowmick, P.: ACCORD: with approximate covering of convex orthogonal decomposition. In: Debled-Rennesson, I., Domenjoud, E., Kerautret, B., Even, P. (eds.) Proceeding of the 16th IAPR International Conference on Discrete Geometry for Computer Imagery, (DGCI). Lecture Notes in Computer Science, vol. 6607, pp. 489\u2013500. Springer, Nancy, France (2011)"},{"issue":"4","key":"18_CR13","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":"18_CR14","series-title":"WG 2009","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-11409-0_1","volume-title":"Proccedings of the International Workshop on Graph-Theoretic Concepts in Computer Science","author":"D Eppstein","year":"2009","unstructured":"Eppstein, D.: Graph-theoretic solutions to computational geometry problems. In: Paul, C., Habib, M. (eds.) Proccedings of the International Workshop on Graph-Theoretic Concepts in Computer Science. WG 2009, vol. 5911, pp. 1\u201316. Springer, Berlin Heidelberg, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-11409-0_1"},{"key":"18_CR15","doi-asserted-by":"publisher","unstructured":"Eppstein, D.: Orthogonal dissection into few rectangles. Discrete Comput. Geom., 1\u201320 (2023). https:\/\/doi.org\/10.1007\/s00454-023-00614-w","DOI":"10.1007\/s00454-023-00614-w"},{"issue":"1","key":"18_CR16","first-page":"179","volume":"5","author":"D Eppstein","year":"2014","unstructured":"Eppstein, D., Mumford, E.: Steinitz theorems for simple orthogonal polyhedra. J. Comput. Geom. 5(1), 179\u2013244 (2014)","journal-title":"J. Comput. Geom."},{"issue":"1","key":"18_CR17","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/0734-189X(84)90139-7","volume":"28","author":"L Ferrari","year":"1984","unstructured":"Ferrari, L., Sankar, P.V., Sklansky, J.: Minimal rectangular partitions of digitized blobs. Comput. Vis. Graph. Image Process. 28(1), 58\u201371 (1984)","journal-title":"Comput. Vis. Graph. Image Process."},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/s00453-016-0247-3","volume":"80","author":"P Floderus","year":"2018","unstructured":"Floderus, P., Jansson, J., Levcopoulos, C., Lingas, A., Sledneu, D.: 3D rectangulations and geometric matrix multiplication. Algorithmica 80, 136\u2013154 (2018)","journal-title":"Algorithmica"},{"key":"18_CR19","first-page":"1","volume":"77","author":"S Hannenhalli","year":"2002","unstructured":"Hannenhalli, S., Hubell, E., Lipshutz, R., Pevzner, P.: Combinatorial algorithms for design of DNA arrays. Adv. Biochem. Eng. Biotechnol. 77, 1\u201319 (2002)","journal-title":"Adv. Biochem. Eng. Biotechnol."},{"key":"18_CR20","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":"18_CR21","doi-asserted-by":"crossref","unstructured":"Li, G., Zhang, H.: A rectangular partition algorithm for planar self-assembly. In: International Conference on Intelligent Robots and Systems, pp. 3213 \u2013 3218. 2005 IEEE\/RSJ, IEEE (2005)","DOI":"10.1109\/IROS.2005.1545324"},{"issue":"7","key":"18_CR22","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.cagd.2008.05.003","volume":"25","author":"JM Lien","year":"2008","unstructured":"Lien, J.M., Amato, N.M.: Approximate convex decomposition of polyhedra and its applications. Comput. Aided Geometric Des. 25(7), 503\u2013522 (2008)","journal-title":"Comput. Aided Geometric Des."},{"key":"18_CR23","doi-asserted-by":"publisher","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.) Proceedings of 7th International Symposium on Algorithms and Computation (ISAAC 2006). vol.\u00a01178, pp. 315\u2013325. (LNCS), Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0009508","DOI":"10.1007\/BFb0009508"},{"key":"18_CR24","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s002240000101","volume":"31","author":"A Lingas","year":"1998","unstructured":"Lingas, A., Soltan, V.: Minimum convex partition of a polygon with holes by cuts in given directions. Theory Comput. Syst. 31, 507\u2013538 (1998)","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"18_CR25","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."},{"key":"18_CR26","doi-asserted-by":"publisher","unstructured":"Maity, A., Dutt, M., Biswas, A.: Rectangularization of digital objects and its relation with straight skeletons. In: Barneva, R.P., Brimkov, V.E., Nordo, G. (eds.) Proceedings of Combinatorial Image Analysis, vol. 13348, pp. 31\u201345. Springer International Publishing, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-23612-9_2","DOI":"10.1007\/978-3-031-23612-9_2"},{"issue":"4","key":"18_CR27","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1109\/43.3182","volume":"7","author":"S Nahar","year":"1988","unstructured":"Nahar, S., Sahni, S.: Fast algorithm for polygon decomposition. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 7(4), 473\u2013483 (1988)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"3","key":"18_CR28","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1109\/TPAMI.1979.4766925","volume":"1","author":"J O\u2019Rourke","year":"1979","unstructured":"O\u2019Rourke, J., Badler, N.: Decomposition of three-dimensional objects into spheres. IEEE Trans. Pattern Anal. Mach. Intell. 1(3), 295\u2013305 (1979)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"18_CR29","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.comgeo.2004.01.007","volume":"28","author":"J O\u2019Rourke","year":"2004","unstructured":"O\u2019Rourke, J., Tewari, G.: The structure of optimal partitions of orthogonal polygons into fat rectangles. Comput. Geom. 28(1), 49\u201371 (2004)","journal-title":"Comput. Geom."},{"issue":"2","key":"18_CR30","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":"07","key":"18_CR31","doi-asserted-by":"publisher","first-page":"1460010","DOI":"10.1142\/S0218001414600106","volume":"28","author":"L Serino","year":"2014","unstructured":"Serino, L., Arcelli, C., di Baja, G.S.: Decomposing 3D objects in simple parts characterized by rectilinear spines. Int. J. Pattern Recognit Artif Intell. 28(07), 1460010 (2014)","journal-title":"Int. J. Pattern Recognit Artif Intell."},{"issue":"8","key":"18_CR32","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/S0262-8856(02)00042-2","volume":"20","author":"S Svensson","year":"2002","unstructured":"Svensson, S., Di Baja, G.S.: Using distance transforms to decompose 3D discrete objects. Image Vis. Comput. 20(8), 529\u2013540 (2002)","journal-title":"Image Vis. Comput."},{"issue":"6","key":"18_CR33","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1145\/3272127.3275029","volume":"37","author":"D Thul","year":"2018","unstructured":"Thul, D., Ladick\u00fd, L., Jeong, S., Pollefeys, M.: Approximate convex decomposition and transfer for animated meshes. ACM Transactions on Graphics 37(6), 226 (2018)","journal-title":"ACM Transactions on Graphics"},{"issue":"4","key":"18_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3528223.3530103","volume":"41","author":"X Wei","year":"2022","unstructured":"Wei, X., Liu, M., Ling, Z., Su, H.: Approximate convex decomposition for 3D meshes with collision-aware concavity and tree search. ACM Trans. Graph. 41(4), 1\u201318 (2022)","journal-title":"ACM Trans. Graph."}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-78125-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T07:06:34Z","timestamp":1733295994000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78125-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,5]]},"ISBN":["9783031781247","9783031781254"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78125-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,5]]},"assertion":[{"value":"5 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICPR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Pattern Recognition","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icpr2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icpr2024.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}