Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 628)
Early work on digital topology is reviewed, including the discrete Jordan curve theorem, adjacency relations and adjacency trees, simple points, and border following.
KeywordsEuclidean Plane Simple Point Digital Picture Simple Closed Curve Hexagonal Grid
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- C. N. Lee and A. Rosenfeld. Connectivity issues in 2D and 3D images. In Proceedings, Conference on Computer Vision and Pattern Recognition, pages 278–285. IEEE Computer Society, 1986.Google Scholar
- C. N. Lee and A. Rosenfeld. Computing the Euler number of a 3D image. In Proceedings, First International Conference on Computer Vision, pages 567–571. IEEE Computer Society, 1987.Google Scholar
- T. Y. Kong, R. Litherland, and A. Rosenfeld. Problems in the topology of binary digital images. In J. van Mill and G. M. Reed, editors, Open Problems in Topology, pages 376–385. North-Holland, Amsterdam, 1990.Google Scholar
- T. Y. Kong and A. Rosenfeld. Digital topology: A comparison of the graph-based and topological approaches. In G. M. Reed, A. W. Roscoe, and R. F. Wachter, editors, Topology and Category Theory in Computer Science, pages 273–289. Oxford University Press, Oxford, 1991.Google Scholar
- A. Rosenfeld and T. Y. Kong. Connectedness of a set, its complement, and their common boundary. In R. A. Melter, A. Rosenfeld, and P. Bhattacharya, editors, Vision Geometry (Hoboken, NJ, October 20–21,1989), pages 125–128. American Mathematical Society, Providence, 1991.Google Scholar
- A. Nakamura and A. Rosenfeld. Topology-preserving deformations of fuzzy digital pictures. In E. Kerre and M. Nachtegael, editors, Fuzzy Techniques in Image Processing. Physica-Verlag, Heidelberg, 1999.Google Scholar
- H. Abelson and A. diSessa. Turtle Geometry. MIT Press, Cambridge, MA, 1980.Google Scholar
- R. Ayala, E. Domínguez, A. R. Francés, and A. Quintero. Weak lighting functions and strong 26-surfaces. Theoretical Computer Science, 2001. To appear.Google Scholar
- R. O. Duda, P. E. Hart, and J. H. Munson. Graphical data processing research study and experimental investigation. Stanford Research Institute, Menlo Park, CA, NTIS AD-650 926, March 1967. 28–30.Google Scholar
- S. Fourey. Nombre d’Intersection et d’Entrelacement de Courbes Discrètes et Application à la Caractérisation de la Préservation de la Topologie en Imagerie. PhD thesis, Université de Caen, France, 2000.Google Scholar
- E. Khalimsky. Pattern analysis of N-dimensional digital images. In Proceedings, International Conference on Systems, Man and Cybernetics, pages 1559–1562. IEEE Systems, Man and Cybernetics Society, 1986.Google Scholar
- T. Y. Kong and E. Khalimsky. Polyhedral analogs of locally finite topological spaces. In R. M. Shortt, editor, General Topology and Applications: Proceedings of the 1988 Northeast Conference, pages 153–164. Marcel Dekker, New York, 1990.Google Scholar
- V. A. Kovalevsky. Topological foundations of shape analysis. In Y. L. O, A. Toet, D. H. Foster, H. J. A. M. Heijmans, and P. Meer, editors, Shape in Picture: Mathematical Description of Shape in Grey-Level Images, pages 21–36. Springer-Verlag, Berlin, 1994.Google Scholar
- D. G. Morgenthaler. Three-dimensional simple points: Serial erosion, parallel thinning and skeletonization. Technical Report TR-1005, Computer Vision Laboratory, University of Maryland, College Park, 1981.Google Scholar
- Y. F. Tsao and K. S. Fu. A 3D parallel skeletonwise thinning algorithm. In Proceedings, Conference on Pattern Recognition and Image Processing, pages 678–683. IEEE Computer Society, 1982.Google Scholar
© Springer Science+Business Media New York 2001