{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:23Z","timestamp":1759063763263},"reference-count":28,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4064,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0304-3975(01)00054-8","type":"journal-article","created":{"date-parts":[[2002,10,9]],"date-time":"2002-10-09T19:39:34Z","timestamp":1034192374000},"page":"67-108","source":"Crossref","is-referenced-by-count":7,"title":["On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology"],"prefix":"10.1016","volume":"283","author":[{"given":"R\u00e9my","family":"Malgouyres","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Malika","family":"More","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"10","key":"10.1016\/S0304-3975(01)00054-8_BIB1","doi-asserted-by":"crossref","first-page":"1014","DOI":"10.1109\/34.159904","article-title":"Parallel architectures and algorithms for image component labelling","volume":"14","author":"Alnuweiri","year":"1992","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"10.1016\/S0304-3975(01)00054-8_BIB2","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","article-title":"On uniformity within NC1","volume":"41","author":"Mix Barrington","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(01)00054-8_BIB3","series-title":"Computational Logic and Proof Theory, 5th Kurt Godel Colloquium KGC\u201997","first-page":"18","article-title":"Alogtime algorithms for tree isomorphism, comparison, and canonization","volume":"vol. 1289","author":"Buss","year":"1997"},{"issue":"4","key":"10.1016\/S0304-3975(01)00054-8_BIB4","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1016\/0031-3203(95)00050-X","article-title":"Algorithms for homotopy classification of binary images","volume":"29","author":"Bykov","year":"1996","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0304-3975(01)00054-8_BIB5","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0196-6774(87)90018-6","article-title":"Problems complete for deterministic logarithmic space","volume":"8","author":"Cook","year":"1987","journal-title":"J. Algorithms"},{"issue":"3","key":"10.1016\/S0304-3975(01)00054-8_BIB6","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1109\/34.21794","article-title":"An EREW PRAM algorithm for image component labelling","volume":"11","author":"Cypher","year":"1989","journal-title":"Correspondence in IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/S0304-3975(01)00054-8_BIB7","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/S0019-9958(86)80006-7","article-title":"Definability by constant-depth polynomial-size circuits","volume":"70","author":"Denenberg","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(01)00054-8_BIB8","series-title":"Finite Model Theory","author":"Ebbinghaus","year":"1995"},{"key":"10.1016\/S0304-3975(01)00054-8_BIB9","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0304-3975(85)90045-3","article-title":"Bounded-depth, polynomial-size circuits for symmetric functions","volume":"36","author":"Fagin","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00054-8_BIB10","series-title":"Synthesis of Parallel Algorithms, Chapter 21","article-title":"The complexity of computation on the parallel random access machine","author":"Fich","year":"1993"},{"key":"10.1016\/S0304-3975(01)00054-8_BIB11","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01744431","article-title":"Parity, circuits and the polynomial hierarchy","volume":"17","author":"Furst","year":"1984","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(01)00054-8_BIB12","series-title":"Metamathematics of First-Order arithmetic","author":"Hajek","year":"1993"},{"key":"10.1016\/S0304-3975(01)00054-8_BIB13","doi-asserted-by":"crossref","unstructured":"G. Herman, Discrete multidimensional Jordan surfaces, Vision geometry, Proc. AMS Spec. Sess., 851st Meet., Hoboken\/NJ (USA) 1989 Contemporary Mathematics, vol. 119, 1991, pp. 85\u201394.","DOI":"10.1090\/conm\/119\/1113901"},{"key":"10.1016\/S0304-3975(01)00054-8_BIB14","series-title":"Descriptive Complexity","author":"Immerman","year":"1999"},{"key":"10.1016\/S0304-3975(01)00054-8_BIB15","series-title":"Handbook of Theoretical Computer Science Vol. A: Algorithms and Complexity","first-page":"67","article-title":"A catalog of complexity classes","author":"Johnson","year":"1990"},{"issue":"5","key":"10.1016\/S0304-3975(01)00054-8_BIB16","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1142\/S0218001495000341","article-title":"On topology preservation in 2-D and 3-D thinning","volume":"9","author":"Kong","year":"1995","journal-title":"Internat. J. Pattern Recognition Artificial Intelligence"},{"key":"10.1016\/S0304-3975(01)00054-8_BIB17","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/0734-189X(89)90147-3","article-title":"Digital topology: introduction and survey","volume":"48","author":"Kong","year":"1989","journal-title":"Comput. Vision Graphics Image Process."},{"key":"10.1016\/S0304-3975(01)00054-8_BIB18","doi-asserted-by":"crossref","unstructured":"A. Lenoir, R. Malgouyres, M. Revenu, Fast computation of the normal vector field of the surface of a 3D discrete object, DGCI\u201996, Lecture Notes in Computer Science, vol. 1176, Springer, Lyon, France, November 1996, pp. 101\u2013112.","DOI":"10.1007\/3-540-62005-2_9"},{"key":"10.1016\/S0304-3975(01)00054-8_BIB19","doi-asserted-by":"crossref","unstructured":"A. Lenoir, Fast estimation of mean curvature on the surface of a 3D discrete object, DGCI\u201997, Lecture Notes in Computer Science, vol. 1347, December 1997, pp. 175\u2013186.","DOI":"10.1007\/BFb0024839"},{"key":"10.1016\/S0304-3975(01)00054-8_BIB20","doi-asserted-by":"crossref","unstructured":"S. Lindell, A Logspace Algorithm for Tree Canonization, Proc. 24th ACM Symp. on Theory of Computing ACM Press, 1992, pp. 400\u2013404.","DOI":"10.1145\/129712.129750"},{"key":"10.1016\/S0304-3975(01)00054-8_BIB21","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0304-3975(98)00347-8","article-title":"Homotopy in 2-dimensional digital images","volume":"230","author":"Malgouyres","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00054-8_BIB22","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1006\/gmod.1999.0517","article-title":"Topology preservation within digital surfaces","volume":"62","author":"Malgouyres","year":"2000","journal-title":"Graphical Models (GMIP)"},{"key":"10.1016\/S0304-3975(01)00054-8_BIB23","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/S0304-3975(01)00054-8_BIB24","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(86)90164-7","article-title":"A topological characterization of thinning","volume":"43","author":"Ronse","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00054-8_BIB25","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/S0019-9958(74)90696-2","article-title":"Adjacency in digital pictures","volume":"26","author":"Rosenfeld","year":"1974","journal-title":"Inform. and Control"},{"issue":"1","key":"10.1016\/S0304-3975(01)00054-8_BIB26","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1006\/gmip.1997.0459","article-title":"Topology-preserving deformations of two-valued digital pictures","volume":"60","author":"Rosenfeld","year":"1998","journal-title":"Graphical Models Image Process."},{"key":"10.1016\/S0304-3975(01)00054-8_BIB27","series-title":"Finite Automata, Formal Logic and Circuit Complexity","author":"Straubing","year":"1994"},{"issue":"4","key":"10.1016\/S0304-3975(01)00054-8_BIB28","first-page":"311","article-title":"Multidimensional digital boundaries","volume":"56","author":"Udupa","year":"1994","journal-title":"CVGIP: Graphical Models Image Process."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000548?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000548?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,10]],"date-time":"2020-03-10T15:55:42Z","timestamp":1583855742000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501000548"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0304397501000548"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00054-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}