World Library  
Flag as Inappropriate
Email this Article

Digital geometry

Article Id: WHEBN0000386413
Reproduction Date:

Title: Digital geometry  
Author: World Heritage Encyclopedia
Language: English
Subject: List of Sega arcade system boards, Outline of discrete mathematics, 3D computer graphics, Cutting sequence, Digital geometry
Collection: Digital Geometry
Publisher: World Heritage Encyclopedia
Publication
Date:
 

Digital geometry

Digital geometry deals with discrete sets (usually discrete point sets) considered to be digitized models or images of objects of the 2D or 3D 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 display of a computer, or in newspapers are in fact digital images.

Its main application areas are computer graphics and 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 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, digital convexity, digital straightness, 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 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.
  • 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.
  • Designing tracking algorithms for digital objects.
  • Functions on digital space.

Digital geometry heavily overlaps with discrete geometry and may be considered as a part thereof.

Contents

  • Digital space 1
  • See also 2
  • References 3
  • Further reading 4
  • External links 5

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).

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. A digital space and its (digital-)connectivity determine a digital topology.

In digital space, the digitally continuous function (A. Rosenfeld, 1986) and the gradually varied function (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 \Sigma to \{ A_1, \dots,A_m \} where A_1< \cdots and A_i are real numbers. This function possesses the following property: If x and y are two adjacent points in \Sigma, assume f(x)=A_i, then f(y)=A_{i}, f(x)=A_{i+1}, or 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 \subset \Sigma and f: D\rightarrow \{ A_1, \dots,A_m \}. The necessary and sufficient condition for the existence of the gradually varied extension F of f is : for each pair of points x and y in D, assume f(x)=A_i and f(y)=A_j, we have |i-j|\le d(x,y), where d(x,y) is the (digital) distance between x and y.

See also

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

  •  
  •  
  •  
  •  
  • Chassery, J., and A. Montanvert. (1991). Geometrie discrete en analyze d’images. Hermes.  
  • Kong, T. Y., and A. Rosenfeld (editors) (1996). Topological Algorithms for Digital Image Processing. Elsevier.  
  • Voss, K. (1993). Discrete Images, Objects, and Functions in Zn. Springer.  
  •  
  • Marchand-Maillet, S., and Y. M. Sharaiha (2000). Binary Digital Image Processing. Academic Press.  
  • Soille, P. (2003). Morphological Image Analysis: Principles and Applications. Springer.  
  • Chen, L. (2004). Discrete Surfaces and Manifolds: A Theory of Digital-Discrete Geometry and Topology. SP Computing.  
  •  

External links

  • IAPR Technical Committee on Discrete Geometry
  • Website on digital geometry and topology
  • Course on digital geometry and mathematical morphology (Ch. Kiselman)
  • DGtal: Open Source Digital Geometry Toolbox and Algorithms library
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.