On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid
type: Item
instance of: scholarly article
title: On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid
zbMATH Open document ID: 0815.68112
DOI: 10.1016/0097-3165(95)90058-6
author: D. Acketa
author: Joviša Žunić
published in: Journal of Combinatorial Theory. Series A
publication date: 1995-03-19T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 52A37
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 734540
zbMATH Keywords: optimization problems
zbMATH Keywords: convex digital polygon
Wikidata QID: Q57926999
MaRDI profile type: Publication
full work available at URL: 0097-3165(95)90058-6
OpenAlex ID: W2025410619
cites work: On the number of linear partitions of the \((m,n)\)-grid
cites work: On integer points in polyhedra: A lower bound
cites work: On the number of digital straight line segments
cites work: On integer points in polyhedra
cites work: Q5772619
cites work: Q3469822
cites work: Convex lattice polygons of minimum area
cites work: Q3968466
description: scientific article; zbMATH DE number 734540