An algorithm to find the number of the digitizations of discs with a fixed radius

DOI10.1016/j.endm.2005.04.006zbMath1179.94016OpenAlexW2024532379MaRDI QIDQ3439222

Benedek Nagy

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2005.04.006

zbMATH Keywords

lattice pointsenumerationgeometric algorithmdigital discscombinatorial image processinginverse discrete tomography

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (7)

On density extrema for digital discs ⋮ Combinatorics of the Gauss digitization under translation in 2D ⋮ Isoperimetrically Optimal Polygons in the Triangular Grid ⋮ Object digitization up to a translation ⋮ Topology-preserving conditions for 2D digital images under rigid transformations ⋮ Computing upper and lower bounds of rotation angles from digital images ⋮ Isoperimetrically optimal polygons in the triangular grid with Jordan-type neighbourhood on the boundary

Cites Work

• Unnamed Item
• On the number of digital discs
• Discrete tomography. Foundations, algorithms, and applications
• Combinatorial Image Analysis

This page was built for publication: An algorithm to find the number of the digitizations of discs with a fixed radius