Digital geometry

From Free net encyclopedia

(Difference between revisions)

Revision as of 13:29, 24 February 2006
Ligulembot (Talk | contribs)
migrate {{[[template:book reference|book reference]]}} to {{[[template:cite book|cite book]]}} using [[Wikipedia:AutoWikiBrowser|AWB]]
Next diff →

Current revision

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 into simplified shapes such as (i) skeletons, by repeated removal of simple points such that the 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.
Reconstructing "real" objects or their properties (area, length, curvature, volume, surface area, and so forth) from digital images.

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

[edit]