{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T19:13:40Z","timestamp":1688757220978},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,6,11]],"date-time":"2011-06-11T00:00:00Z","timestamp":1307750400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s00224-011-9335-6","type":"journal-article","created":{"date-parts":[[2011,6,10]],"date-time":"2011-06-10T15:58:37Z","timestamp":1307721517000},"page":"111-123","source":"Crossref","is-referenced-by-count":2,"title":["In-place Algorithm for Erasing a Connected Component in a Binary Image"],"prefix":"10.1007","volume":"50","author":[{"given":"Tetsuo","family":"Asano","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,11]]},"reference":[{"key":"9335_CR1","first-page":"704","volume-title":"Proc. ISAAC 2007, Sendai","author":"T. Asano","year":"2007","unstructured":"Asano, T., Bitou, S., Motoki, M., Usui, N.: In-place algorithm for image rotation. In: Proc. ISAAC 2007, Sendai, Dec. 2007, pp.\u00a0704\u2013715 (2007)"},{"key":"9335_CR2","first-page":"165","volume-title":"Proc. 24th European Workshop on Computational Geometry","author":"T. Asano","year":"2008","unstructured":"Asano, T.: Constant-working-space image scan with a given angle. In: Proc. 24th European Workshop on Computational Geometry, Nancy, France, pp.\u00a0165\u2013168 (2008)"},{"key":"9335_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/978-3-642-03456-5_17","volume-title":"Efficient Algorithms","author":"T. Asano","year":"2009","unstructured":"Asano, T., Bereg, S., Kirkpatrick, D.: Finding nearest larger neighbors: a case study in algorithm design and analysis. In: Albers, S., Alt, H., Naeher, S. (eds.) Efficient Algorithms. Lecture Notes in Computer Science, pp.\u00a0249\u2013260. Springer, Berlin (2009)"},{"key":"9335_CR4","unstructured":"Asano, T., Tanaka, H.: Constant-working space algorithm for connected components labeling. Technical report, Special Interest Group on Computation, IEICE of Japan, 2008"},{"issue":"4","key":"9335_CR5","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1142\/S0218195902000906","volume":"12","author":"P. Bose","year":"2002","unstructured":"Bose, P., Morin, P.: An improved algorithm for subdivision traversal without extra storage. Int. J. Comput. Geom. Appl. 12(4), 297\u2013308 (2002)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9335_CR6","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1145\/997817.997854","volume-title":"Proc. 20th Annual ACM Symposium on Computational Geometry","author":"H. Br\u00f6nnimann","year":"2004","unstructured":"Br\u00f6nnimann, H., Chen, E.Y., Chan, T.M.: Towards in-place geometric algorithms and data structures. In: Proc. 20th Annual ACM Symposium on Computational Geometry, pp.\u00a0239\u2013246 (2004)"},{"issue":"4","key":"9335_CR7","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1080\/136588197242310","volume":"11","author":"M. Berg de","year":"1997","unstructured":"de Berg, M., van Kreveld, M., van Oostrum, R., Overmars, M.: Simple traversal of a subdivision without extra storage. Int. J. Geogr. Inf. Sci. 11(4), 359\u2013373 (1997)","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"9335_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. Elsevier, Amsterdam (2004)"},{"issue":"11","key":"9335_CR9","doi-asserted-by":"crossref","first-page":"1314","DOI":"10.1145\/50087.50092","volume":"31","author":"P. Kwok","year":"1988","unstructured":"Kwok, P.: A\u00a0thinning algorithm by contour generation. Commun. ACM, 31(11), 1314\u20131324 (1988)","journal-title":"Commun. ACM"},{"issue":"9","key":"9335_CR10","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1109\/34.161346","volume":"14","author":"L. Lam","year":"1992","unstructured":"Lam, L., Lee, S.-W., Suen, C.Y.: Thinning methodologies\u2014a comprehensive survey. IEEE Trans. Pattern Anal. Mach. Intell. 14(9), 869\u2013885 (1992)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9335_CR11","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0304-3975(01)00054-8","volume":"283","author":"R. Malgouyresa","year":"2002","unstructured":"Malgouyresa, R., Moreb, M.: On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology. Theor. Comput. Sci. 283, 67\u2013108 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"9335_CR12","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1145\/321556.321570","volume":"17","author":"A. Rosenfeld","year":"1970","unstructured":"Rosenfeld, A.: Connectivity in digital pictures. J. ACM 17(3), 146\u2013160 (1970)","journal-title":"J. ACM"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9335-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-011-9335-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9335-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,24]],"date-time":"2021-11-24T23:57:20Z","timestamp":1637798240000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-011-9335-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,11]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["9335"],"URL":"https:\/\/doi.org\/10.1007\/s00224-011-9335-6","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,11]]}}}