by

Wikipedia Bot (@wikibot, 0)

Digital geometry

Table of contents

Azriel Rosenfeld

 0  0 

Binary image

 0  0 

Bresenham's line algorithm

 0  0 

Canberra distance

 0  0 

Closing (morphology)

 0  0 

Controlled image base

 0  0 

Digital differential analyzer (graphics algorithm)

 0  0 

Digital image

 0  0 

Dilation (morphology)

 0  0 

Distance transform

 0  0 

Erosion (morphology)

 0  0 

Euler operator (digital geometry)

 0  0 

Gradually varied surface

 0  0 

Hit-or-miss transform

 0  0 

LCD crosstalk

 0  0 

Mathematical morphology

 0  0 

Midpoint circle algorithm

 0  0 

Morphological gradient

 0  0 

Morphological skeleton

 0  0 

Nonogram

 0  0 

Pick's theorem

 0  0 

Pixel

 1  0 

Pixel aspect ratio

 0  0 

Pruning (morphology)

 0  0 

Raster graphics

 1  0 

Reeve tetrahedra

 0  0 

SPHARM-PDM

 0  0 

Summed-area table

 0  0 

Taxicab geometry

 0  0 

Thinning (morphology)

 0  0 

Top-hat transform

 0  0 

Topological skeleton

 0  0 

 Ancestors (5)

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic + Create my own version