The Euler characteristic of discrete object

Features
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1347)

Abstract

We introduce the curvature indexes of the boundary of a discrete object, and using these indexes of points, we define vertex angles of discrete surfaces as an extension of the chain codes for digital curves. Next, we prove a relation between the number of points on the surface and the genus of a discrete object. This is the angular Euler characteristic of a discrete object. These relations derive a parallel algorithm for the computation of the Euler characteristic of a discrete object.

Keywords

Euler Characteristic Discrete Version Cell Decomposition Curvature Index Chain Code 
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.

References

  1. 1.
    Imiya, A.: Geometry of three-dimensional neighborhood and its applications, Transactions of Information Processing Society of Japan, Vol. 34, pp. 2153–2164, 1993 (in Japanese).Google Scholar
  2. 2.
    Kenmochi, Y., Imiya, A., and Ezuquera, R.: Polyhedra generation from lattice points, Miguet, S., and Montanvert, A., and Ubéda, S. eds.: Discrete Geometry for Computer Imagery, pp.127–138, Lecture Notes in Computer Science, Vol. 1176, Springer-Verlag: Berlin, 1996.Google Scholar
  3. 3.
    Kenmochi, Y. and Imiya, A.: Deformation of discrete object surfaces, Sommer, G., Daniilidis, K. and Pauli, J. eds.: Computer Analysis of Images and Patterns, pp. 146–153, Lecture Notes in Computer Science, Vol. 1296, Springer-Verlag: Berlin, 1997.Google Scholar
  4. 4.
    Aktouf, Z., Bertrand, G., and Perrton, L.: A three-dimensional holes closing algorithm, pp. 36–38, Miguet, S., and Montanvert, A., and Ubéda, S. eds.: Discrete Geometry for Computer Imagery, Lecture Notes in Computer Science, Vol. 1176, Springer-Verlag: Berlin, 1996.Google Scholar
  5. 5.
    Grünbaum, B.:Convex Polytopes, Interscience: London, 1967.Google Scholar
  6. 6.
    Okabe, A., Boots, B., and Sugihara, K.: Spatial Tessellations Concepts and Applications of Voronoi Diagrams, John Wiley& Sons: Chichster, 1992.Google Scholar
  7. 7.
    Hopf, H.:Diferential Geometry in the Large, Lecture Notes in Mathematics, Vol. 1000, Springer-Verlag: Berlin, 1983.Google Scholar
  8. 8.
    Serra, J.:Image Analysis and Mathematical Morphology, Academic Press: London, 1982.Google Scholar
  9. 9.
    Toriwaki, J.-I.: Digital Image processing for Image Understanding, Vols.1 and 2, Syokodo: Tokyo, 1988 (in Japanese).Google Scholar
  10. 10.
    Yonekura, T., Toriwaki, J.-I., and Fukumura, T., and Yokoi, S.: On connectivity and the Euler number of three-dimensional digitized binary picture, Transactions on IECE Japan, Vol. E63, pp. 815–816, 1980.Google Scholar
  11. 11.
    Toriwaki, J.-I., Yokoi, S., Yonekura, T., and Fukumura, 'P.: Topological properties and topological preserving transformation of a three-dimensional binary picture, Proc. of the 6th ICPR, pp. 414–419, 1982.Google Scholar
  12. 12.
    Lee, C.-N., Poston, T., and Rosenfeld, A.: Holes and genus of 2D and 3D digital images, CVGIP Graphical Models and Image Processing, Vol. 55, pp. 20–47, 1993.Google Scholar
  13. 13.
    Françon, J.: Sur la topologie d'un plan arithmétique, Theoretical Computer Sciences, Vol. 156, pp. 159–176, 1996.Google Scholar
  14. 14.
    Bonnington, C. P. and Little, C.H.C.: The Foundation, of Topological Graph Theory Springer-Verlag:Berlin, 1995.Google Scholar
  15. 15.
    Bieri, H. and Nef, W.: Algorithms for the Euler characteristic and related additive firnctionals of digital objects, Computer Vision, Graphics, and Image Processing Vol. 28, pp. 166–175, 1984.Google Scholar
  16. 16.
    Bieri, H. and Nef, W.: A recursive sweep-plane algorithm, determining all cells of a finite division of R d, Computing Vol. 28, pp. 189–198, 1982.Google Scholar
  17. 17.
    Bieri, H. and Nef, W.: A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form, Linear Algebra and Its Applications, Vol. 52/53, pp. 69–97, 1983.Google Scholar
  18. 18.
    Bied, H. and Nef, W.: A sweep-plane algorithm for computing the Eulercharacteristic of polyhedra represented in Boolean form, Computing, Vol. 34, pp. 287–304, 1985.Google Scholar
  19. 19.
    Stark, H. and Peng, H.: Shape estimation in computer tomography from minimal data, Proceedings of 9th ICPR, Vol. 1, pp. 184–186, 1988.Google Scholar
  20. 20.
    Ludwing, D.: The Radon transform on Euclidean space, Comm. Pure and Applied Mathematics, Vol. 19, pp. 49–81, 1966.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  1. 1.Dept. of Applied MathematicsUniversity of HamburgHamburgGermany

Personalised recommendations