An exact construction of digital convex polygons with minimal diameter

DOI10.1016/0012-365X(95)00195-3zbMath0848.68109WikidataQ57925538 ScholiaQ57925538MaRDI QIDQ1916119

Snežana Matić-Kekić, Dragan M. Acketa, Joviša D. Žunić

Publication date: 8 October 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

digital geometrydigital convex polygongreedy lower bound

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

Unnamed Item ⋮ Broadcast Transmission to Prioritizing Receivers ⋮ On density extrema for digital discs ⋮ The Perimeter of optimal convex lattice polygons in the sense of different metrics ⋮ Limit shape of convex lattice polygons having the minimal \(L_\infty\) diameter w. r. t. the number of their vertices

Cites Work

• Unnamed Item
• Unnamed Item
• On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid
• The minimal size of a square which includes a digital convex 2K–gon

This page was built for publication: An exact construction of digital convex polygons with minimal diameter