Boundary approximations in digital geometry

  • Vladimir Kovalevski
Algorithms And Techniques
Part of the Lecture Notes in Computer Science book series (LNCS, volume 399)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    V.A. Kovalevsky, "Determination and approximation of contours in noisy images", in "Automated Image Analysis in Medicine and Biology", Ambrosius Barth, Leipzig, 1987 (in print).Google Scholar
  2. 2.
    T. Pavlidis, Structural Pattern Recognition, Springer-Verlag, New York, 1977.Google Scholar
  3. 3.
    C.M. Williams, "An efficient algorithm for the piecewise linear approximation of planar curves", Computer Graphics and Image Processing, vol. 8, pp. 286–293, 1978.Google Scholar
  4. 4.
    V.A. Kovalevsky, "Discrete geometry and image processing", Proceedings of the International Conference on Computers, Systems and Signal Processing. Bangalore, India, pp. 934–938, December 9–12, 1984.Google Scholar
  5. 5.
    V.A. Kovalevsky and A. Wieczorek, "Fast Recognition of Digital Straight Segments", Technical Report 86-73-03, Institute of Cybernetics, Berlin (GDR), 1986.Google Scholar
  6. 6.
    T.A. Anderson and C.E. Kim, "Representation of digital line segments and their preimages", Computer Vision, Graphics and Image Processing, vol. 30, no. 3, pp. 279–288, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Vladimir Kovalevski
    • 1
  1. 1.Central Institute of Cybernetics and Information ProcessesAcademy of Sciences of the G.D.R.Berlin

Personalised recommendations