Abstract
This paper deals with the widely studied problem of decomposition of digital shapes. The Tangential Cover [7] is a powerful tool that computes the set of all maximal segments of a digital curve. In previous works [4] , the Tangential Cover has been extended to a new class of “thick digital curves”. This extension brought up some major issues. In the present paper, we generalize even more the notion of Tangential Cover, in order to fix those issues. We propose a new relevant way of representing thick digital curves, as sets of consecutive triangles. Then, we study the use of this representation to define a generalized Tangential Cover, and we show some results produced by our technique.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Buzer, L.: Digital line recognition, convex hull, thickness, a unified and logarithmic technique. In: Reulke, R., Eckardt, U., Flach, B., Knauer, U., Polthier, K. (eds.) IWCIA 2006. LNCS, vol. 4040, pp. 189–198. Springer, Heidelberg (2006)
Buzer, L.: Computing multiple convex hulls of a simple polygonal chain in linear time. In: European Workshop on Computational Geometry (2007)
Debled-Rennesson, I., Feschet, F., Rouyer-Degli, J.: Optimal blurred segments decomposition in linear time. In: Andrès, É., Damiand, G., Lienhardt, P. (eds.) DGCI 2005. LNCS, vol. 3429, pp. 371–382. Springer, Heidelberg (2005)
Faure, A., Feschet, F.: Tangential cover for thick digital curves. In: 14th Intl. Conference on Discrete Geometry for Computer Imagery (submitted, 2008)
Feschet, F.: Canonical representations of discrete curves. Pattern Anal. Appl. 8(1-2), 84–94 (2005)
Feschet, F., Tougne, L.: On the min dss problem of closed discrete curves. Discrete Applied Mathematics 151(1-3), 138–153 (2005)
Feschet, F., Tougne, L.: Optimal time computation of the tangent of a discrete curve: Application to the curvature. In: Bertrand, G., Couprie, M., Perroton, L. (eds.) Discrete Geometry for Computer Imagery, 8th International Conference, DCGI 1999, Marne-la-Vallee, France, March 17-19, 1999, pp. 31–40 (1999)
Klette, R., Rosenfeld, A.: Digital Geometry: Geometric Methods for Digital Picture Analysis. In: Computer Graphics and Geometric Modeling, Morgan Kaufman, San Francisco (2004)
Melkman, A.A.: On-line construction of the convex hull of a simple polyline. Inf. Process. Lett. 25(1), 11–12 (1987)
Overmars, M., van Leeuwen, J.: Maintenance of configurations in the plane. J. Comput. Syst. Sci. 23(2), 166–204 (1981)
Réveillès, J.P.: Géométrie discrète, calcul en nombres entiers et algorithmique. PhD thesis, Université Louis Pasteur (1991)
Seidel, R.: Constrained delaunay triangulations and voronoi diagrams with obstacles. Technical Report 260, Institute for Information Processing, Graz, Austria (1988)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Faure, A., Feschet, F. (2008). Robust Decomposition of Thick Digital Shapes. In: Brimkov, V.E., Barneva, R.P., Hauptman, H.A. (eds) Combinatorial Image Analysis. IWCIA 2008. Lecture Notes in Computer Science, vol 4958. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78275-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-78275-9_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78274-2
Online ISBN: 978-3-540-78275-9
eBook Packages: Computer ScienceComputer Science (R0)