A New Concept for Digital Geometry

A concept for geometry in a topological space with finitely many elements without the use of infinitesimals is presented. The notions of congruence, collinearity, convexity, digital lines, perimeter, area, volume, etc. are defined. The classical notion of continuous mappings is transferred (without changes) onto finite spaces. A slightly more general notion of connectivity preserving mappings is introduced. Applications for shape analysis are demonstrated.

[1]  Chul E. Kim,et al.  Representation of digital line segments and their preimages , 1985, Comput. Vis. Graph. Image Process..

[2]  Jack Bresenham,et al.  A linear algorithm for incremental digital display of circular arcs , 1977, CACM.

[3]  V. A. Kovalevsky,et al.  Finite Topology and Image Analysis , 1992 .

[4]  V. Kovalevsky,et al.  New definition and fast recognition of digital straight segments and arcs , 1990, [1990] Proceedings. 10th International Conference on Pattern Recognition.

[5]  Herbert Freeman,et al.  Computer Processing of Line-Drawing Images , 1974, CSUR.

[6]  Azriel Rosenfeld,et al.  Digital Picture Processing , 1976 .

[7]  Vladimir A. Kovalevsky,et al.  Finite topology as applied to image analysis , 1989, Comput. Vis. Graph. Image Process..

[8]  Jack Bresenham,et al.  Algorithm for computer control of a digital plotter , 1965, IBM Syst. J..