Skip to main content

Euclidean paths for representing and transforming scanned characters

  • Vectorization and Segmentation
  • Conference paper
  • First Online:
Graphics Recognition Algorithms and Systems (GREC 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1389))

Included in the following conference series:

  • 114 Accesses

Abstract

Euclidean Paths are a way of representing the boundary of discrete objects. The main advantage of this representation is that it allows us to smooth a discrete contour which is intrinsically jagged while preserving all the initial information it contains. We recall here the general model of Euclidean Paths and the construction of tangent driven Euclidean paths associated with 8-connected boundaries [7]. Tangent driven Euclidean paths provide a good approximation of the real contour of a 2D region given the digitized contour of the region. We then present as an application how tangent driven Euclidean paths can be used for some geometrical transformations of scanned characters.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Debled-Renesson, I., Reveilles, J.-P.: A linear algorithm for segmentation of discrete curves. International Journal of Pattern Recognition and Artificial Intelligence 9 (1995) 635–662

    Google Scholar 

  2. Dorst, L., Smeulders, A.W.: Decomposition of discrete curves into picewise segments in linear time. Contemporary Math. 119 (1991) 169–195

    Google Scholar 

  3. Reveilles, J.-P.: Géométrie discréte, calcul en nombres entiers et algorithmique. PhD thesis,Université Louis Pasteur (1991)

    Google Scholar 

  4. Shao, L., Zou, H.: Curve Fitting with Bézier Cubics. Graphical Models and Image Processing 58 (1996) 223–232

    Google Scholar 

  5. Sharaiha, Y.M., Christophides, N.: An optimal algorithm for the straight segment approximation of digital arcs. Computer Vision, Graphics, and Image Processing 55 (1993) 397–407

    Google Scholar 

  6. Troesch, A.: Interprétation géométrique de l'algorithme d'Euclide et reconnaissance de segment. Theoretical Computer Science 115 (1993) 291–319

    Google Scholar 

  7. Vialard, A.: Chemins Euclidiens: un Modèle de Représentation des Contours Discrets. PhD thesis, Université Bordeaux 1 (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Karl Tombre Atul K. Chhabra

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vialard, A. (1998). Euclidean paths for representing and transforming scanned characters. In: Tombre, K., Chhabra, A.K. (eds) Graphics Recognition Algorithms and Systems. GREC 1997. Lecture Notes in Computer Science, vol 1389. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64381-8_39

Download citation

  • DOI: https://doi.org/10.1007/3-540-64381-8_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64381-4

  • Online ISBN: 978-3-540-69766-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics