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.
Preview
Unable to display preview. Download preview PDF.
References
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
Dorst, L., Smeulders, A.W.: Decomposition of discrete curves into picewise segments in linear time. Contemporary Math. 119 (1991) 169–195
Reveilles, J.-P.: Géométrie discréte, calcul en nombres entiers et algorithmique. PhD thesis,Université Louis Pasteur (1991)
Shao, L., Zou, H.: Curve Fitting with Bézier Cubics. Graphical Models and Image Processing 58 (1996) 223–232
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
Troesch, A.: Interprétation géométrique de l'algorithme d'Euclide et reconnaissance de segment. Theoretical Computer Science 115 (1993) 291–319
Vialard, A.: Chemins Euclidiens: un Modèle de Représentation des Contours Discrets. PhD thesis, Université Bordeaux 1 (1996)
Author information
Authors and Affiliations
Editor information
Rights 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