# Digital geometry

> Mediated Wiki article. Canonical URL: https://mediated.wiki/source/Digital_geometry
> Markdown URL: https://mediated.wiki/source/Digital_geometry.md
> Source: https://en.wikipedia.org/wiki/Digital_geometry
> Source revision: 1326158764
> License: Creative Commons Attribution-ShareAlike 4.0 International (https://creativecommons.org/licenses/by-sa/4.0/)

Geometry Projecting a sphere to a plane Branches Euclidean Non-Euclidean Elliptic Spherical Hyperbolic Non-Archimedean geometry Projective Affine Synthetic Analytic Algebraic Arithmetic Diophantine Differential Riemannian Symplectic Discrete differential Complex Finite Discrete/Combinatorial Digital Convex Computational Fractal Incidence Noncommutative geometry Noncommutative algebraic geometry Concepts Features Dimension Straightedge and compass constructions Angle Curve Diagonal Orthogonality (Perpendicular) Parallel Vertex Congruence Similarity Symmetry Zero-dimensional Point One-dimensional Line Line segment Ray Curve Length Two-dimensional Surface Plane Area Polygon Triangle Centers Altitude Hypotenuse Pythagorean theorem Circular Hyperbolic Spherical Quadrilateral Parallelogram Square Rectangle Rhombus Rhomboid Trapezoid Kite Circle Radius Diameter Circumference Disk Area Three-dimensional Surface area Volume Polyhedron Platonic Solid Tetrahedron cuboid Cube Octahedron Dodecahedron Icosahedron Pyramid Solid of revolution Sphere Great circle Cylinder Cone Four - other-dimensional 4-polytope Simplex 5-cell Hypercube Tesseract n-sphere Hypersphere Geometers by name Aida Aryabhata Ahmes Alhazen Apollonius Archimedes Atiyah Baudhayana Bolyai Brahmagupta Cartan Chern Coxeter Descartes Euclid Euler Gauss Gromov Hilbert Huygens Jyeṣṭhadeva Kātyāyana Khayyám Klein Lobachevsky Manava Minkowski Minggatu Pascal Pythagoras Parameshvara Poincaré Riemann Sakabe Sijzi al-Tusi Veblen Virasena Yang Hui al-Yasamin Zhang List of geometers by period BCE Ahmes Baudhayana Manava Pythagoras Euclid Archimedes Apollonius 1–1400s Zhang Kātyāyana Aryabhata Brahmagupta Virasena Alhazen Sijzi Khayyám al-Yasamin al-Tusi Yang Hui Parameshvara 1400s–1700s Jyeṣṭhadeva Descartes Pascal Huygens Minggatu Euler Sakabe Aida 1700s–1900s Gauss Lobachevsky Bolyai Riemann Klein Poincaré Hilbert Minkowski Cartan Veblen Coxeter Chern Present day Atiyah Gromov v t e

Deals with digitized models or images of objects of the 2D or 3D Euclidean space

This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. Please help improve this article by introducing more precise citations. (January 2015) (Learn how and when to remove this message)

**Digital geometry** deals with [discrete](/source/Discrete_space) sets (usually discrete [point](/source/Point_(geometry)) sets) considered to be [digitized](/source/Digitizing) [models](/source/Scale_model) or [images](/source/Image) of objects of the 2D or 3D [Euclidean space](/source/Euclidean_space). Simply put, *digitizing* is replacing an object by a discrete set of its points. The images we see on the TV screen, the [raster](/source/Raster_graphics) display of a computer, or in newspapers are in fact [digital](/source/Digital_data) images.

Its main application areas are [computer graphics](/source/Computer_graphics) and [image analysis](/source/Image_analysis).

Main aspects of study are:

- Constructing digitized representations of objects, with the emphasis on precision and efficiency (either by means of synthesis, see, for example, [Bresenham's line algorithm](/source/Bresenham's_line_algorithm) or digital disks, or by means of digitization and subsequent processing of digital images).

- Study of properties of digital sets; see, for example, [Pick's theorem](/source/Pick's_theorem), digital convexity, [digital straightness](https://en.wikipedia.org/w/index.php?title=Digital_straightness&action=edit&redlink=1), or digital planarity.

- Transforming digitized representations of objects, for example (A) into simplified shapes such as (i) skeletons, by repeated removal of simple points such that the [digital topology](/source/Digital_topology) of an image does not change, or (ii) medial axis, by calculating local maxima in a distance transform of the given digitized object representation, or (B) into modified shapes using [mathematical morphology](/source/Mathematical_morphology).

- Reconstructing "real" objects or their properties (area, length, curvature, volume, surface area, and so forth) from digital images.

- Study of digital curves, digital surfaces, and [digital manifolds](/source/Digital_manifold).

- Designing tracking algorithms for digital objects.

- Functions on digital space.

- Curve sketching, a method of drawing a curve pixel by pixel.

Tracing a curve on a triangular mesh

Digital geometry heavily overlaps with [discrete geometry](/source/Discrete_geometry) and may be considered as a part thereof.

## Digital space

A 2D digital space usually means a 2D grid space that only contains integer points in 2D Euclidean space. A 2D image is a function on a 2D digital space (See [image processing](/source/Image_processing)).

In Rosenfeld and Kak's book, digital connectivity are defined as the relationship among elements in digital space. For example, 4-connectivity and 8-connectivity in 2D. Also see [pixel connectivity](/source/Pixel_connectivity). A digital space and its (digital-)connectivity determine a [digital topology](/source/Digital_topology).

In digital space, the digitally continuous function (A. Rosenfeld, 1986) and the [gradually varied function](/source/Gradually_varied_surface) (L. Chen, 1989) were proposed, independently.

A digitally continuous function means a function in which the value (an integer) at a digital point is the same or off by at most 1 from its neighbors. In other words, if *x* and *y* are two adjacent points in a digital space, |*f*(*x*) − *f*(*y*)| ≤ 1.

A gradually varied function is a function from a digital space Σ {\displaystyle \Sigma } to { A 1 , … , A m } {\displaystyle \{A_{1},\dots ,A_{m}\}} where A 1 < ⋯ < A m {\displaystyle A_{1}<\cdots <A_{m}} and A i {\displaystyle A_{i}} are real numbers. This function possesses the following property: If *x* and *y* are two adjacent points in Σ {\displaystyle \Sigma } , assume f ( x ) = A i {\displaystyle f(x)=A_{i}} , then f ( y ) = A i {\displaystyle f(y)=A_{i}} , f ( x ) = A i + 1 {\displaystyle f(x)=A_{i+1}} , or A i − 1 {\displaystyle A_{i-1}} . So we can see that the gradually varied function is defined to be more general than the digitally continuous function.

An extension theorem related to above functions was mentioned by A. Rosenfeld (1986) and completed by L. Chen (1989). This theorem states: Let D ⊂ Σ {\displaystyle D\subset \Sigma } and f : D → { A 1 , … , A m } {\displaystyle f:D\rightarrow \{A_{1},\dots ,A_{m}\}} . The necessary and sufficient condition for the existence of the gradually varied extension F {\displaystyle F} of f {\displaystyle f} is : for each pair of points x {\displaystyle x} and y {\displaystyle y} in D {\displaystyle D} , assume f ( x ) = A i {\displaystyle f(x)=A_{i}} and f ( y ) = A j {\displaystyle f(y)=A_{j}} , we have | i − j | ≤ d ( x , y ) {\displaystyle |i-j|\leq d(x,y)} , where d ( x , y ) {\displaystyle d(x,y)} is the (digital) distance between x {\displaystyle x} and y {\displaystyle y} .

## See also

- [Computational geometry](/source/Computational_geometry)

- [Digital topology](/source/Digital_topology)

- [Discrete geometry](/source/Discrete_geometry)

- [Combinatorial geometry](/source/Combinatorial_geometry)

- [Tomography](/source/Tomography)

- [Point cloud](/source/Point_cloud)

## References

- A. Rosenfeld, `Continuous' functions on digital pictures, Pattern Recognition Letters, v.4 n.3, p. 177–184, 1986.

- L. Chen, The necessary and sufficient condition and the efficient algorithms for gradually varied fill, Chinese Sci. Bull. 35 (10), pp 870–873, 1990.

## Further reading

- [Rosenfeld, Azriel](/source/Azriel_Rosenfeld) (1969). *Picture Processing by Computer*. Academic Press.

- [Rosenfeld, Azriel](/source/Azriel_Rosenfeld) (1976). *Digital picture analysis*. Berlin: Springer-Verlag. [ISBN](/source/ISBN_(identifier)) [0-387-07579-8](https://en.wikipedia.org/wiki/Special:BookSources/0-387-07579-8).

- [Rosenfeld, Azriel](/source/Azriel_Rosenfeld); Kak, Avinash C. (1982). *Digital picture processing*. Boston: Academic Press. [ISBN](/source/ISBN_(identifier)) [0-12-597301-2](https://en.wikipedia.org/wiki/Special:BookSources/0-12-597301-2).

- [Rosenfeld, Azriel](/source/Azriel_Rosenfeld) (1979). *Picture Languages*. Academic Press. [ISBN](/source/ISBN_(identifier)) [0-12-597340-3](https://en.wikipedia.org/wiki/Special:BookSources/0-12-597340-3).

- Chassery, J.; A. Montanvert. (1991). *Geometrie discrete en analyze d'images*. Hermes. [ISBN](/source/ISBN_(identifier)) [2-86601-271-2](https://en.wikipedia.org/wiki/Special:BookSources/2-86601-271-2).

- Kong, T. Y.; Rosenfeld, A., eds. (1996). *Topological Algorithms for Digital Image Processing*. Elsevier. [ISBN](/source/ISBN_(identifier)) [0-444-89754-2](https://en.wikipedia.org/wiki/Special:BookSources/0-444-89754-2).

- Voss, K. (1993). [*Discrete Images, Objects, and Functions in Zn*](https://archive.org/details/discreteimagesob0000voss). Springer. [ISBN](/source/ISBN_(identifier)) [0-387-55943-4](https://en.wikipedia.org/wiki/Special:BookSources/0-387-55943-4).

- [Herman, G. T.](/source/Gabor_Herman) (1998). [*Geometry of Digital Spaces*](https://archive.org/details/geometryofdigita0000herm). Birkhauser. [ISBN](/source/ISBN_(identifier)) [0-8176-3897-0](https://en.wikipedia.org/wiki/Special:BookSources/0-8176-3897-0).

- Marchand-Maillet, S.; Y. M. Sharaiha (2000). [*Binary Digital Image Processing*](https://archive.org/details/binarydigitalima0000marc). Academic Press. [ISBN](/source/ISBN_(identifier)) [0-12-470505-7](https://en.wikipedia.org/wiki/Special:BookSources/0-12-470505-7).

- Soille, P. (2003). *Morphological Image Analysis: Principles and Applications*. Springer. [ISBN](/source/ISBN_(identifier)) [3-540-42988-3](https://en.wikipedia.org/wiki/Special:BookSources/3-540-42988-3).

- Chen, L. (2004). *Discrete Surfaces and Manifolds: A Theory of Digital-Discrete Geometry and Topology*. SP Computing. [ISBN](/source/ISBN_(identifier)) [0-9755122-1-8](https://en.wikipedia.org/wiki/Special:BookSources/0-9755122-1-8).

- [Rosenfeld, Azriel](/source/Azriel_Rosenfeld); Klette, Reinhard (2004). [*Digital Geometry: Geometric Methods for Digital Image Analysis (The Morgan Kaufmann Series in Computer Graphics)*](https://www.mi.auckland.ac.nz/index.php?option=com_content&view=article&id=49&Itemid=49). San Diego: Morgan Kaufmann. [ISBN](/source/ISBN_(identifier)) [1-55860-861-3](https://en.wikipedia.org/wiki/Special:BookSources/1-55860-861-3).

- Chen, L. (2014). [*Digital and discrete geometry: Theory and Algorithms*](https://www.springer.com/us/book/9783319120980). Springer. [ISBN](/source/ISBN_(identifier)) [978-3-319-12099-7](https://en.wikipedia.org/wiki/Special:BookSources/978-3-319-12099-7).

- [Kovalevsky, Vladimir A](/source/Vladimir_Antonovich_Kovalevsky). (2008). *Geometry of locally finite spaces computer agreeble topology and algorithms for computer imagery*. Berlin. [ISBN](/source/ISBN_(identifier)) [978-3-9812252-0-4](https://en.wikipedia.org/wiki/Special:BookSources/978-3-9812252-0-4).

## External links

- [IAPR Technical Committee on Discrete Geometry](https://www.cb.uu.se/~tc18/)

- [Website on digital geometry and topology](https://www.mi.auckland.ac.nz/index.php?option=com_content&view=article&id=50&Itemid=66/)

- [Course on digital geometry and mathematical morphology (Ch. Kiselman)](https://web.archive.org/web/20060507023951/http://www.math.uu.se/~kiselman/dgmm2004.html)

- [DGtal: Open Source Digital Geometry Toolbox and Algorithms library](https://dgtal.org)

v t e Geometry History Timeline Lists of geometry topics Foundations of geometry Outline of geometry Euclidean geometry Convex Discrete Plane geometry Solid Affine Trigonometry Spherical Generalized Fundamental Concepts (Euclidean) Point Line Plane Space Distance Angle Parallel Perpendicular Triangle Circle Polygon Congruence Similarity Euclid's Elements Euclidean space Coordinate system Dimension 2D 3D Non-Euclidean geometry Non-Euclidean space Elliptic Hyperbolic Spherical Other kinds of geometry Algebraic Arithmetic Diophantine Differential Riemannian Symplectic Absolute Analytic Complex Computational Conformal Constructive Discrete Finite Information Non-Archimedean Noncommutative Ordered Projective Spectral Tropical Metric Lists Lists of geometry topics Combinatorial computational geometry topics Differential geometry topics Formulas in elementary geometry Formulas in Riemannian geometry Geometry topics Knot theory topics Numerical computational geometry topics Polygons Shapes Outline of geometry Glossaries Algebraic geometry Arithmetic and diophantine geometry Classical algebraic geometry Differential geometry and topology Riemannian and metric geometry Symplectic geometry Related Geometric algebra Geometric measure theory Geometric analysis Geometric group theory Manifold Vector calculus Geometry of numbers Lattice theory Elliptic curve Foundations of geometry Axiomatic system Categories: Geometry Trigonometry Topology Category:History of geometry

---
Adapted from the Wikipedia article [Digital geometry](https://en.wikipedia.org/wiki/Digital_geometry) by Wikipedia contributors ([contributor history](https://en.wikipedia.org/wiki/Digital_geometry?action=history)). Available under [Creative Commons Attribution-ShareAlike 4.0 International](https://creativecommons.org/licenses/by-sa/4.0/). Changes may have been made.
