On the number of linear partitions of the \((m,n)\)-grid
From MaRDI portal
Publication:1178217
DOI10.1016/0020-0190(91)90240-IzbMath0737.68080WikidataQ57925746 ScholiaQ57925746MaRDI QIDQ1178217
Dragan M. Acketa, Joviša D. Žunić
Publication date: 26 June 1992
Published in: Information Processing Letters (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (12)
A characterization of 2-threshold functions via pairs of prime segments ⋮ On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid ⋮ A further study for the upper bound of the cardinality of Farey vertices and application in discrete geometry ⋮ The minimal size of a square which includes a digital convex 2K–gon ⋮ Measuring linearity of curves in \(2D\) and \(3D\) ⋮ Unnamed Item ⋮ Relative blocking in posets ⋮ Shape ellipticity from Hu moment invariants ⋮ Digital Straightness ⋮ Asymptotics of the number of 2-threshold functions ⋮ Digital straightness -- a review ⋮ Cutting Corners by Circles and Spheres
Cites Work
This page was built for publication: On the number of linear partitions of the \((m,n)\)-grid
