{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:42:56Z","timestamp":1725856976949},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319388502"},{"type":"electronic","value":"9783319388519"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-38851-9_21","type":"book-chapter","created":{"date-parts":[[2016,5,31]],"date-time":"2016-05-31T11:33:54Z","timestamp":1464694434000},"page":"310-325","source":"Crossref","is-referenced-by-count":0,"title":["A Merging Heuristic for the Rectangle Decomposition of Binary Matrices"],"prefix":"10.1007","author":[{"given":"Julien","family":"Subercaze","sequence":"first","affiliation":[]},{"given":"Christophe","family":"Gravier","sequence":"additional","affiliation":[]},{"given":"Pierre-Olivier","family":"Rocher","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,1]]},"reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-11805-0","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D Eppstein","year":"2010","unstructured":"Eppstein, D.: Graph-theoretic solutions to computational geometry problems. In: Paul, C., Habib, M. (eds.) WG 2009. LNCS, vol. 5911, pp. 1\u201316. Springer, Heidelberg (2010)"},{"issue":"1","key":"21_CR2","doi-asserted-by":"crossref","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. Graph. Image Process. 28(1), 58\u201371 (1984)","journal-title":"Comput. Graph. Image Process."},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-3-540-74198-5_8","volume-title":"Energy Minimization Methods in Computer Vision and Pattern Recognition","author":"D Gao","year":"2007","unstructured":"Gao, D., Wang, Y.: Decomposing document images by heuristic search. In: Yuille, A.L., Zhu, S.-C., Cremers, D., Wang, Y. (eds.) EMMCVPR 2007. LNCS, vol. 4679, pp. 97\u2013111. Springer, Heidelberg (2007)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Gonzalez, T., Zheng, S.-Q.: Bounds for partitioning rectilinear polygons. In: 1st Symposium on Computational Geometry, pp. 281\u2013287. ACM (1985)","DOI":"10.1145\/323233.323269"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/3-540-18625-5_45","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"C Levcopoulos","year":"1987","unstructured":"Levcopoulos, C.: Improved bounds for covering general polygons with rectangles. In: Nori, K.V. (ed.) Foundations of Software Technology and Theoretical Computer Science. LNCS, vol. 287, pp. 95\u2013102. Springer, Heidelberg (1987)"},{"key":"21_CR6","unstructured":"Lingas, A., Pinter, R.Y., Rivest, R.L., Shamir, A.: Minimum edge length partitioning of rectilinear polygons. In: Proceeding of 20th Allerton Conference Communication Control and Computing, pp. 53\u201363 (1982)"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Liou, W.T., Tan, J.J., Lee, R.C.: Minimum partitioning simple rectilinear polygons in o (n log log n)-time. In: Proceedings of the Fifth Annual Symposium on Computational Geometry, pp. 344\u2013353. ACM (1989)","DOI":"10.1145\/73833.73871"},{"issue":"3","key":"21_CR8","doi-asserted-by":"crossref","first-page":"245","DOI":"10.3233\/FI-1978-2116","volume":"2","author":"W Lipski","year":"1979","unstructured":"Lipski, W., Lodi, E., Luccio, F., Mugnai, C., Pagli, L.: On two dimensional data organization ii. Fundamenta Informaticae 2(3), 245\u2013260 (1979)","journal-title":"Fundamenta Informaticae"},{"issue":"4","key":"21_CR9","doi-asserted-by":"crossref","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."},{"key":"21_CR10","unstructured":"Ohtsuki, T.: Minimum dissection of rectilinear regions. In: Proceeding IEEE Symposium on Circuits and Systems, Rome, pp. 1210\u20131213 (1982)"},{"key":"21_CR11","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/978-3-319-22348-3_20","volume-title":"Enterprise Information Systems","author":"P-O Rocher","year":"2015","unstructured":"Rocher, P.-O., Gravier, C., Subercaze, J., Preda, M.: Video stream transmodality. In: Cordeiro, J., Hammoudi, S., Maciaszek, L., Camp, O., Filipe, J. (eds.) ICEIS 2014. LNBIP, vol. 227, pp. 361\u2013378. Springer, Heidelberg (2015)"},{"issue":"1","key":"21_CR12","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02189307","volume":"9","author":"V Soltan","year":"1993","unstructured":"Soltan, V., Gorpinevich, A.: Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles. Discrete Comput. Geom. 9(1), 57\u201379 (1993)","journal-title":"Discrete Comput. Geom."},{"issue":"11","key":"21_CR13","doi-asserted-by":"crossref","first-page":"1609","DOI":"10.1109\/83.725368","volume":"7","author":"IM Spiliotis","year":"1998","unstructured":"Spiliotis, I.M., Mertzios, B.G.: Real-time computation of two-dimensional moments on binary images using image block representation. IEEE Trans. Image Process. 7(11), 1609\u20131615 (1998)","journal-title":"IEEE Trans. Image Process."},{"issue":"12","key":"21_CR14","doi-asserted-by":"crossref","first-page":"4279","DOI":"10.1016\/j.patcog.2012.05.012","volume":"45","author":"T Suk","year":"2012","unstructured":"Suk, T., H\u00f6schl IV, C., Flusser, J.: Decomposition of binary images a survey and comparison. Pattern Recogn. 45(12), 4279\u20134291 (2012)","journal-title":"Pattern Recogn."},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/978-3-540-25945-9_36","volume-title":"Current Topics in Artificial Intelligence","author":"AP Tom\u00e1s","year":"2004","unstructured":"Tom\u00e1s, A.P., Bajuelos, A.L.: Generating Random Orthogonal Polygons. In: Conejo, R., Urretavizcaya, M., P\u00e9rez-de-la-Cruz, J.-L. (eds.) CAEPIA\/TTIA 2003. LNCS (LNAI), vol. 3040, pp. 364\u2013373. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-38851-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T17:55:27Z","timestamp":1656611727000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-38851-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319388502","9783319388519"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-38851-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}