Pages that link to "Item:Q1345882"
From MaRDI portal
The following pages link to On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid (Q1345882):
Displayed 18 items.
- Shape elongation from optimal encasing rectangles (Q623133) (← links)
- Small grid embeddings of 3-polytopes (Q629826) (← links)
- Primitive zonotopes (Q724942) (← links)
- Measure of circularity for parts of digital boundaries and its fast computation (Q733129) (← links)
- On the polyhedral complexity of the integer points in a hyperball (Q952452) (← links)
- Limit shape of convex lattice polygons having the minimal \(L_\infty\) diameter w. r. t. the number of their vertices (Q1584291) (← links)
- Asymptotics of convex lattice polygonal lines with a constrained number of vertices (Q1686395) (← links)
- Improved bounds on the diameter of lattice polytopes (Q1747971) (← links)
- An elementary algorithm for digital arc segmentation (Q1827813) (← links)
- An exact construction of digital convex polygons with minimal diameter (Q1916119) (← links)
- Upper bounds on the maximal number of facets of 0/1-polytopes (Q1964653) (← links)
- Embedding stacked polytopes on a polynomial-size grid (Q2358818) (← links)
- On maximal convex lattice polygons inscribed in a plane convex set (Q2472723) (← links)
- The Perimeter of optimal convex lattice polygons in the sense of different metrics (Q2721592) (← links)
- Realizing Planar Graphs as Convex Polytopes (Q3223957) (← links)
- Broadcast Transmission to Prioritizing Receivers (Q4591231) (← links)
- (Q4953527) (← links)
- Computational determination of the largest lattice polytope diameter (Q5918843) (← links)