On covering a digital disc with concentric circles in \(\mathbb Z^2\)
From MaRDI portal
Publication:393104
DOI10.1016/j.tcs.2013.07.036zbMath1301.68235OpenAlexW1975300284MaRDI QIDQ393104
Peer Stelldinger, Partha Bhowmick, Sahadev Bera, Bhargab Bikram Bhattacharya
Publication date: 16 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.07.036
Related Items
From prima quadraginta octant to lattice sphere through primitive integer operations ⋮ On the characterization of absentee-voxels in a spherical surface and volume of revolution in \({\mathbb Z}^3\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid
- On the number of factors of Sturmian words
- Number-theoretic interpretation and construction of a digital circle
- An elementary algorithm for digital arc segmentation
- Digital straightness -- a review
- Determining digital circularity using integer intervals
- An Elegant Continued Fraction for π
- An Efficient Randomized Algorithm for Detecting Circles
- Digital Circularity and Its Applications
- Best approximate circles on integer grids
- A High-Speed Algorithm for the Generation of Straight Lines and Circular Arcs
- A linear algorithm for incremental digital display of circular arcs
- A Measure for Circularity of Digital Figures
- A two-step circle detection algorithm from the intersecting chords
- Cramer-Rao Lower Bounds for Estimation of a Circular Arc Center and Its Radius
This page was built for publication: On covering a digital disc with concentric circles in \(\mathbb Z^2\)