Discrete images, objects, and functions in \(Z^ n\)
From MaRDI portal
Publication:685990
zbMath0778.68094MaRDI QIDQ685990
Publication date: 6 October 1993
Published in: Algorithms and Combinatorics (Search for Journal in Brave)
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Computing methodologies for image processing (68U10) Graph theory (including graph drawing) in computer science (68R10) Topological linear incidence structures (51H10)
Related Items
An output-sensitive algorithm to compute the normal vector of a digital plane ⋮ A polygonal approximation for general 4-contours corresponding to weakly simple curves ⋮ Lyndon + Christoffel = digitally convex ⋮ 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 ⋮ Strongly normal sets of contractible tiles in \(n\) dimensions ⋮ Discrete combinatorial geometry ⋮ A combinatorial technique for generation of digital plane using GCD ⋮ Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid ⋮ 3D discrete rotations using hinge angles ⋮ Dynamic Minimum Length Polygon ⋮ Distance with generalized neighbourhood sequences in \(n D\) and \(\infty D\) ⋮ Digital Straightness ⋮ Configurations induced by discrete rotations: Periodicity and quasi-periodicity properties ⋮ Continued Fractions and Digital Lines with Irrational Slopes ⋮ On the min DSS problem of closed discrete curves ⋮ On the min DSS problem of closed discrete curves ⋮ Two linear-time algorithms for computing the minimum length polygon of a digital contour ⋮ An elementary algorithm for digital arc segmentation ⋮ Generic axiomatized digital surface-structures ⋮ Digital straightness -- a review ⋮ A note on dimension and gaps in digital geometry ⋮ Combinatorics on Adjacency Graphs and Incidence Pseudographs ⋮ Surface digitizations by dilations which are tunnel-free ⋮ Local and global topology preservation in locally finite sets of tiles
