Some formulas for numbers of line segments and lines in a rectangular grid.

MaRDI QIDQ4909709zbMATH OpenFDO

Authors Pentti Haukkanen, Jorma K. Merikoski

Publication date 21 March 2013

Full work available at URL https://arxiv.org/abs/1108.1041

zbMATH Keywords

lattice pointsrectangular gridrecursive formula

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Recurrences (11B37) Lattice points in specified regions (11P21)

Abstract: We present a formula for the number of line segments connecting q+1 points of an n_1 x...x n_k 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, n_1=n_2. The well-known case q=2 is so generalized.

Recommendations

• Formulas for the number of gridlines
• Asymptotics for numbers of line segments and lines in a square grid
• The number of digital straight lines on an N*N grid
• On the number of linear partitions of the (m,n)-grid
• scientific article; zbMATH DE number 749666

Cited in

(7)

• On the number of linear partitions of the (m,n)-grid
• Intersection points of the diagonals for parallel equidistant point series
• Regular dissections of an infinite strip
• The number of digital straight lines on an N*N grid
• Minimal number of points on a grid forming line segments of equal length
• Counting Divisions of a 2 × n Rectangular Grid
• Formulas for the number of gridlines

This page was built for publication: Some formulas for numbers of line segments and lines in a rectangular grid.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909709)