Abstract
The paper presents some algorithms in digital geometry based on the topology of cell complexes. The paper contains an axiomatic justification of the necessity of using cell complexes in digital geometry. Algorithms for solving the following problems are presented: tracing of curves and surfaces, recognition of digital straight line segments (DSS), segmentation of digital curves into longest DSS, recognition of digital plane segments, computing the curvature of digital curves, filling of interiors of n-dimensional regions (n=2,3,4), labeling of components (n=2,3), computing of skeletons (n=2, 3).
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
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
Andres, E.: Le Plan Discret, Colloque Geometrie Discrete en Imagerie, pp. 45–61. University of Strasbourg (1993)
Kovalevsky, V.: Finite Topology as Applied to Image Analysis. Computer Vision, Graphics and Image Processing 45, 141–161 (1989)
New Definition and Fast Recognition of Digital Straight Segments and Arcs. In: 10th International Conference on Pattern Recognition, Atlantic City, June 17-21, vol. II, pp. 31–34. IEEE Press, Los Alamitos (1990)
Kovalevsky, V.: Finite Topology and Image Analysis. In: Hawkes, P. (ed.) Advances in Electronics and Electron Physics, vol. 84, pp. 197–259. Academic Press, London (1992)
Kovalevsky, V.: Digital Geometry Based on the Topology of Abstract Cell Complexes. In: Proceedings of the Third International Colloquium Discrete Geometry for Computer Imagery, September 20-21, pp. 259–284. University of Strasbourg (1993)
Kovalevsky, V.: Applications of Digital Straight Segments to Economical Image Encoding. In: Ahronovitz, E. (ed.) DGCI 1997. LNCS, vol. 1347, pp. 51–62. Springer, Heidelberg (1997)
Kovalevsky, V.: A Topological Method of Surface Representation. In: Bertrand, G., Couprie, M., Perroton, L. (eds.) DGCI 1999. LNCS, vol. 1568, pp. 118–135. Springer, Heidelberg (1999)
Kovalevsky, V.: Algorithms and Data Structures for Computer Topology. In: Bertrand, G., Imiya, A., Klette, R. (eds.) Digital and Image Geometry. LNCS, vol. 2243, pp. 37–58. Springer, Heidelberg (2002)
Kovalevsky, V.: Curvature in Digital 2D Images. International Journal of Pattern Recognition and Artificial Intelligence 15(7), 1183–1200 (2001)
Kovalevsky, V.: Multidimensional Cell Lists for Investigating 3-Manifolds. Discrete Applied Mathematics 125(1), 25–43 (2002)
Kovalevsky, V.: Axiomatic Digital Topology (2004) (to be published)
Kovalevsky, V.: Recognition of Digital Straight Segments in Cell Complexes (2004) (to be published)
Kozinets, B.N.: An Iteration-Algorithm for Separating the Convex Hulls of two Sets. In: Vapnik, V.N. (ed.) Lerning Algorithms for Pattern Recognition. Publishing house Sovetskoe Radio, Moscow (1973) (in Russian language)
Reveillès, J.P.: Structure des Droit Discretes. Journée mathématique et informatique (1989)
Reveillès, J.P.: Combinatorial Pieces in Digital Lines and Planes. In: Vision geometry III. Proceedings of SPIE, vol. 2573, pp. 23–34 (1995)
Urbanek, C.: Computer Graphics Tutorials - Visualizing of the Kovalevsky Algorithm for Surface Presentation, Graduation Thesis, University of Applied Sciences, Berlin (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kovalevsky, V. (2004). Algorithms in Digital Geometry Based on Cellular Topology. In: Klette, R., Žunić, J. (eds) Combinatorial Image Analysis. IWCIA 2004. Lecture Notes in Computer Science, vol 3322. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30503-3_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-30503-3_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23942-0
Online ISBN: 978-3-540-30503-3
eBook Packages: Computer ScienceComputer Science (R0)