How a Digital Computer Can Tell Whether a Line is Straight (Q3219790)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3887095
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How a Digital Computer Can Tell Whether a Line is Straight |
scientific article; zbMATH DE number 3887095 |
Statements
How a Digital Computer Can Tell Whether a Line is Straight (English)
0 references
1982
0 references
computational geometry
0 references
digital image processing
0 references
regular rectangular lattice
0 references
finite sequence of lattice points
0 references
straight line
0 references
digitization
0 references
digitally convex
0 references
0.78947043
0 references
0.78303784
0 references
0.7781705
0 references
The paper deals with a question arising in digital image processing: given a regular rectangular lattice, whether a finite sequence of lattice points can be regarded as a ''straight line''? Under a certain definition of ''digitization'' the authors provide necessary and sufficient conditions for a digital arc to be straight. Further, necessary and sufficient conditions for a finite set of lattice points to be ''digitally convex'' are announced.
0 references