Pages that link to "Item:Q3493299"
From MaRDI portal
The following pages link to The number of digital straight lines on an N*N grid (Q3493299):
Displaying 21 items.
- Formulas for the number of gridlines (Q646615) (← links)
- On the number of linear partitions of the \((m,n)\)-grid (Q1178217) (← links)
- Digital straightness -- a review (Q1827822) (← links)
- Sampling properties of the discrete Radon transform (Q1827828) (← links)
- Random generation of finite Sturmian words (Q1917511) (← links)
- Asymptotics of the number of 2-threshold functions (Q2051779) (← links)
- Digital straight segment filter for geometric description (Q2061807) (← links)
- A characterization of 2-threshold functions via pairs of prime segments (Q2136278) (← links)
- Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity (Q2255825) (← links)
- Generalized Hausdorff dimensions of sets of real numbers with zero entropy expansion (Q2908171) (← links)
- Asymptotics for numbers of line segments and lines in a square grid (Q2909029) (← links)
- The Number of Khalimsky-Continuous Functions between Two Points (Q3003526) (← links)
- Cutting Corners by Circles and Spheres (Q3438922) (← links)
- Sturmian and Episturmian Words (Q3522857) (← links)
- A Shared Steganographic File System with Error Correction (Q3540959) (← links)
- Iterated Floor Function, Algebraic Numbers, Discrete Chaos, Beatty Subsequences, Semigroups (Q4286802) (← links)
- On the number of digital convex polygons inscribed into an (m,m)-grid (Q4324156) (← links)
- Digital Straightness, Circularity, and Their Applications to Image Analysis (Q4648755) (← links)
- Digital Straightness (Q4917088) (← links)
- Reconstruction of tomographic images using analog projections and the digital Radon transform (Q5955129) (← links)
- On the number of tiles visited by a line segment on a rectangular grid (Q6080812) (← links)
