On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid (Q1345882): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the number of linear partitions of the \((m,n)\)-grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: On integer points in polyhedra: A lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of digital straight line segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On integer points in polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5772619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3469822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex lattice polygons of minimum area / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3968466 / rank
 
Normal rank

Latest revision as of 12:18, 23 May 2024

scientific article
Language Label Description Also known as
English
On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid
scientific article

    Statements

    On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid (English)
    0 references
    0 references
    0 references
    19 March 1995
    0 references
    0 references
    0 references
    0 references
    0 references
    optimization problems
    0 references
    convex digital polygon
    0 references
    0 references
    0 references