An exact construction of digital convex polygons with minimal diameter (Q1916119): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The minimal size of a square which includes a digital convex 2<i>K</i>–gon / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3993321 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3968466 / rank | |||
Normal rank | |||
Latest revision as of 13:00, 24 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact construction of digital convex polygons with minimal diameter |
scientific article |
Statements
An exact construction of digital convex polygons with minimal diameter (English)
0 references
8 October 1996
0 references
digital geometry
0 references
digital convex polygon
0 references
greedy lower bound
0 references
0 references
