Some formulas for numbers of line segments and lines in a rectangular grid
Abstract
We present a formula for the number of line segments connecting q+1 points of an n1 x...x nk rectangular grid. As corollaries, we obtain formulas for the number of lines through at least q points and, respectively, through exactly q points of the grid. The well-known case k=2 is so generalized. We also present recursive formulas for these numbers assuming k=2, n1=n2. The well-known case q=2 is so generalized.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.