{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:36Z","timestamp":1759638276229},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540476511"},{"type":"electronic","value":"9783540476528"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11907350_9","type":"book-chapter","created":{"date-parts":[[2006,10,12]],"date-time":"2006-10-12T11:58:22Z","timestamp":1160654302000},"page":"98-109","source":"Crossref","is-referenced-by-count":2,"title":["Fast Filling Operations Used in the Reconstruction of Convex Lattice Sets"],"prefix":"10.1007","author":[{"given":"Sara","family":"Brunetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Daurat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Attila","family":"Kuba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/3-540-49477-4_27","volume-title":"SOFSEM \u201998: Theory and Practice of Informatics","author":"M. Gebala","year":"1998","unstructured":"Gebala, M.: The reconstruction of convex polyominoes from horizontal and vertical projections. In: Rovan, B. (ed.) SOFSEM 1998. LNCS, vol.\u00a01521, pp. 350\u2013359. Springer, Heidelberg (1998)"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0024-3795(01)00435-9","volume":"339","author":"S. Brunetti","year":"2001","unstructured":"Brunetti, S., Del Lungo, A., Del Ristoro, F., Kuba, A., Nivat, M.: Reconstruction of 4- and 8-connected convex discrete sets from row and column projections. Linear Algebra Appl.\u00a0339, 37\u201357 (2001)","journal-title":"Linear Algebra Appl."},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"371","DOI":"10.4153\/CJM-1957-044-3","volume":"9","author":"H.J. Ryser","year":"1957","unstructured":"Ryser, H.J.: Combinatorial properties of matrices of zeroes and ones. Canad. J. Math.\u00a09, 371\u2013377 (1957)","journal-title":"Canad. J. Math."},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0734-189X(84)90031-8","volume":"27","author":"A. Kuba","year":"1984","unstructured":"Kuba, A.: Reconstruction of two-directionally connected binary patterns from their two orthogonal projections. Comp. Vis. Graph. Image process.\u00a027, 249\u2013265 (1984)","journal-title":"Comp. Vis. Graph. Image process."},{"issue":"5-6","key":"9_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0020-0190(00)00162-9","volume":"77","author":"G.H. Woeginger","year":"2001","unstructured":"Woeginger, G.H.: The reconstruction of polyominoes from their horizontal and vertical projections. Inform. Process. Lett.\u00a077(5-6), 225\u2013229 (2001)","journal-title":"Inform. Process. Lett."},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0304-3975(94)00293-2","volume":"155","author":"E. Barcucci","year":"1996","unstructured":"Barcucci, E., Del Lungo, A., Nivat, M., Pinzani, R.: Reconstructing convex polyominoes from horizontal and vertical projections. Theoret. Comput. Sci.\u00a0155, 321\u2013347 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0304-3975(03)00050-1","volume":"304","author":"S. Brunetti","year":"2003","unstructured":"Brunetti, S., Daurat, A.: An algorithm reconstructing convex lattice sets. Theoret. Comput. Sci.\u00a0304, 35\u201357 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR8","unstructured":"Brunetti, S., Daurat, A.: Reconstruction of discrete sets from two or more X-rays in any direction. In: Proc. of IWCIA 2000, Universit\u00e9 de Caen, pp. 241\u2013258 (2000)"},{"key":"9_CR9","series-title":"The Art of Computer Programming","first-page":"458","volume-title":"Sorting and Searching","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: Balanced Trees (section 6.2.3). In: Sorting and Searching. The Art of Computer Programming, vol.\u00a03, pp. 458\u2013475. Addison-Wesley, Reading (1998)"},{"key":"9_CR10","unstructured":"Brunetti, S., Daurat, A.: Reconstruction of Q-convex sets. In: Herman, G.T., Kuba, A. (eds.) Advances in Discrete Tomography and its Applications. Appl. Numer. Harmon. Anal., Birkh\u00e4user (to appear)"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"2271","DOI":"10.1090\/S0002-9947-97-01741-8","volume":"349","author":"R.J. Gardner","year":"1997","unstructured":"Gardner, R.J., Gritzmann, P.: Discrete tomography: Determination of finite sets by X-rays. Trans. Amer. Math. Soc.\u00a0349, 2271\u20132295 (1997)","journal-title":"Trans. Amer. Math. Soc."},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.tcs.2004.10.001","volume":"332","author":"A. Daurat","year":"2005","unstructured":"Daurat, A.: Determination of Q-convex sets by Xrays. Theoret. Comput. Sci.\u00a0332, 19\u201345 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.tcs.2005.06.033","volume":"347","author":"S. Brunetti","year":"2005","unstructured":"Brunetti, S., Daurat, A.: Random generation of Q-convex sets. Theoret. Comput. Sci.\u00a0347, 393\u2013414 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR14","unstructured":"Daurat, A.: Convexit\u00e9 dans le plan discret. Application \u00e0 la tomographie. Ph.D thesis, LLAIC1, and LIAFA Universit\u00e9 Paris 7 (2000)"}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry for Computer Imagery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11907350_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:03:50Z","timestamp":1558285430000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11907350_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540476511","9783540476528"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11907350_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}