{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:52:17Z","timestamp":1743108737449,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540896388"},{"type":"electronic","value":"9783540896395"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89639-5_64","type":"book-chapter","created":{"date-parts":[[2008,12,2]],"date-time":"2008-12-02T04:18:50Z","timestamp":1228191530000},"page":"669-677","source":"Crossref","is-referenced-by-count":3,"title":["Linear Time Constant-Working Space Algorithm for Computing the Genus of a Digital Object"],"prefix":"10.1007","author":[{"given":"Valentin E.","family":"Brimkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reneta","family":"Barneva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"64_CR1","doi-asserted-by":"crossref","unstructured":"Asano, T.: Constant-working space algorithm for image processing. In: Proc. of the First AAAC Annual Meeting, Hong Kong (April 2008) (to appear)","DOI":"10.1007\/978-3-642-00826-9_12"},{"key":"64_CR2","unstructured":"Asano, T.: Constant-working space image scan with a given angle. In: Proc. of the 24th European Workshop on Computational Geometry, Nancy, March 2008, pp. 165\u2013168 (2008)"},{"key":"64_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1007\/978-3-540-77120-3_61","volume-title":"Algorithms and Computation","author":"T. Asano","year":"2007","unstructured":"Asano, T., Biotu, S., Motoki, M., Usui, N.: In-place algorithm for image rotation. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol.\u00a04835, pp. 704\u2013715. Springer, Heidelberg (2007)"},{"key":"64_CR4","unstructured":"Asano, T., Buzer, L.: Constant-working space algorithm for connected components counting with extension, personal communication (to appear, 2008)"},{"key":"64_CR5","unstructured":"Asano, T., Tanaka, H.: Constant-working space algorithm for connected components labeling, IEICE Technical Report, Special Interest Group on Computation, Japan, IEICE-COMP2008-1, vol.\u00a0108(1), pp. 1\u20138 (2008)"},{"key":"64_CR6","unstructured":"Asano, T., Tanaka, H.: Constant-working space algorithm for Euclidean distance transform, IEICE Technical Report, Special Interest Group on Computation, Japan, IEICE-COMP2008-2, vol.\u00a0108(1), pp. 9\u201314 (2008)"},{"key":"64_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/11785293_34","volume-title":"Algorithm Theory \u2013 SWAT 2006","author":"H. Blunck","year":"2006","unstructured":"Blunck, H., Vahrenhold, J.: In-place algorithms for computing (layers of) maxima. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol.\u00a04059, pp. 363\u2013374. Springer, Heidelberg (2006)"},{"key":"64_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-540-30503-3_21","volume-title":"Combinatorial Image Analysis","author":"V.E. Brimkov","year":"2004","unstructured":"Brimkov, V.E., Klette, R.: Curves, hypersurfaces, and good pairs of adjacency relations. In: Klette, R., \u017duni\u0107, J. (eds.) IWCIA 2004. LNCS, vol.\u00a03322, pp. 276\u2013290. Springer, Heidelberg (2004)"},{"issue":"4","key":"64_CR9","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TPAMI.2007.70725","volume":"30","author":"V.E. Brimkov","year":"2008","unstructured":"Brimkov, V.E., Klette, R.: Border and surface tracing - theoretical foundations. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a030(4), 577\u2013590 (2008)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"64_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/11774938_2","volume-title":"Combinatorial Image Analysis","author":"V.E. Brimkov","year":"2006","unstructured":"Brimkov, V.E., Maimone, A., Nordo, G.: Counting gaps in binary pictures. In: Reulke, R., Eckardt, U., Flach, B., Knauer, U., Polthier, K. (eds.) IWCIA 2006. LNCS, vol.\u00a04040, pp. 16\u201324. Springer, Heidelberg (2006)"},{"key":"64_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-24698-5_20","volume-title":"LATIN 2004: Theoretical Informatics","author":"H. Br\u00f6nniman","year":"2004","unstructured":"Br\u00f6nniman, H., Chan, T.M.: Space-efficient algorithms for computing the convex hull of a simple polygonal line in a linear time. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 162\u2013171. Springer, Heidelberg (2004)"},{"key":"64_CR12","series-title":"Lecture Notes in Computer Science","first-page":"197","volume-title":"LATIN 2002: Theoretical Informatics","author":"H. Br\u00f6nniman","year":"2002","unstructured":"Br\u00f6nniman, H., Iacono, J., Katajainen, J., Morin, P., Morrison, J., Toussaint, G.: In-place planar convex hull algorithms. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol.\u00a02286, pp. 197\u2013205. Springer, Heidelberg (2002)"},{"issue":"5","key":"64_CR13","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0167-8655(88)90078-5","volume":"8","author":"M.-H. Chen","year":"1988","unstructured":"Chen, M.-H., Yan, P.-F.: A fast algorithm to calculate the Euler number for binary image. Pattern Recognition Letters\u00a08(5), 295\u2013297 (1988)","journal-title":"Pattern Recognition Letters"},{"key":"64_CR14","volume-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"M.S. Garey","year":"1979","unstructured":"Garey, M.S., Johnson, D.S.: Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman & Co., San Francisco (1979)"},{"issue":"1-2","key":"64_CR15","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(98)00162-5","volume":"237","author":"V. Geffert","year":"2000","unstructured":"Geffert, V., Katajainen, J., Pasanen, T.: Asymptotically efficient in-place merging. Theoretical Computer Science\u00a0237(1-2), 159\u2013181 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"64_CR16","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0020-0190(99)00038-1","volume":"70","author":"J. Katajainen","year":"1999","unstructured":"Katajainen, J., Pasanen, T.: In-place sorting with fewer moves. Information Processing Letters\u00a070(1), 31\u201337 (1999)","journal-title":"Information Processing Letters"},{"issue":"4","key":"64_CR17","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01178508","volume":"31","author":"J. Katajainen","year":"1994","unstructured":"Katajainen, J., Pasanen, T., Titan, G.: Sorting multisets stably in minimum space. Acta Informatica\u00a031(4), 301\u2013313 (1994)","journal-title":"Acta Informatica"},{"key":"64_CR18","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":"64_CR19","first-page":"33","volume-title":"Foundations of Image Understanding","author":"T.Y. Kong","year":"2001","unstructured":"Kong, T.Y.: Digital topology. In: Davis, L.S. (ed.) Foundations of Image Understanding, pp. 33\u201371. Kluwer, Boston (2001)"},{"issue":"2","key":"64_CR20","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/568547.568565","volume":"30","author":"T. Pasanen","year":"1999","unstructured":"Pasanen, T.: In-place algorithms for sorting problems. ACM SIGACT News\u00a030(2), 61 (1999)","journal-title":"ACM SIGACT News"},{"issue":"3","key":"64_CR21","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1145\/321556.321570","volume":"17","author":"A. Rosenfeld","year":"1970","unstructured":"Rosenfeld, A.: Connectivity in digital pictures. Journal of the ACM\u00a017(3), 146\u2013160 (1970)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Advances in Visual Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89639-5_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,25]],"date-time":"2023-03-25T01:03:59Z","timestamp":1679706239000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-89639-5_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540896388","9783540896395"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89639-5_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}