On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology

Author： Malgouyres R.   More M.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.283, Iss.1, 2002-06, pp. : 67-108

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

3D Digital Topology under Binary Transformation with Applications

By Saha P.K.   Chaudhuri B.B.  

Computer Vision and Image Understanding, Vol. 63, Iss. 3, 1996-05 ,pp. : 418-429

Academic Press

Access to resources Recommend Favorite

Computational complexity of some problems involving congruences on algebras

By Bergman C.   Slutzki G.  

Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. : 591-608

Elsevier

Access to resources Recommend Favorite

The Computational Complexity of Some Problems of Linear Algebra

By Buss J.F.   Frandsen G.S.   Shallit J.O.  

Journal of Computer and System Sciences, Vol. 58, Iss. 3, 1999-06 ,pp. : 572-596

Academic Press

Access to resources Recommend Favorite

Evaluating 2D and 3D geovisualisations for basic spatial assessment

By Seipel Stefan  

Behaviour and Information Technology, Vol. 32, Iss. 8, 2013-08 ,pp. : 845-858

Taylor & Francis Ltd

Access to resources Recommend Favorite

3D reconstruction from 2D images with hierarchical continuous simplices

By Tan Yunhao  

The Visual Computer, Vol. 23, Iss. 9-11, 2007-09 ,pp. : 905-914

Springer Publishing Company

Access to resources Recommend Favorite