Discrete images, objects, and functions in Z^ n
zbMATH Open0778.68094MaRDI QIDQ685990FDOQ685990
Authors: Klaus Voss 
Publication date: 6 October 1993
Published in: Algorithms and Combinatorics (Search for Journal in Brave)
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Computing methodologies for image processing (68U10) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Topological linear incidence structures (51H10)
Cited In (28)
- Realization theory and design of digital images.
- Continued Fractions and Digital Lines with Irrational Slopes
- On the min DSS problem of closed discrete curves
- Discrete geometry and numerical images
- Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid
- An output-sensitive algorithm to compute the normal vector of a digital plane
- Configurations induced by discrete rotations: Periodicity and quasi-periodicity properties
- Surface digitizations by dilations which are tunnel-free
- Discrete combinatorial geometry
- A combinatorial technique for generation of digital plane using GCD
- Lyndon + Christoffel = digitally convex
- Combinatorics on Adjacency Graphs and Incidence Pseudographs
- Strongly normal sets of contractible tiles in \(n\) dimensions
- A note on dimension and gaps in digital geometry
- An elementary algorithm for digital arc segmentation
- A polygonal approximation for general 4-contours corresponding to weakly simple curves
- Local and global topology preservation in locally finite sets of tiles
- Digital straightness -- a review
- Generic axiomatized digital surface-structures
- 3D discrete rotations using hinge angles
- On the min DSS problem of closed discrete curves
- Two linear-time algorithms for computing the minimum length polygon of a digital contour
- Digital straightness
- Distance with generalized neighbourhood sequences in \(n D\) and \(\infty D\)
- Digital functions and data reconstruction. Digital-discrete methods
- Run-hierarchical structure of digital lines with irrational slopes in terms of continued fractions and the Gauss map
- Convex digital polygons, maximal digital straight segments and convergence of discrete geometric estimators
- Dynamic minimum length polygon
This page was built for publication: Discrete images, objects, and functions in \(Z^ n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685990)
