Non-greedy optimal digital convex polygons

zbMATH Open0876.90078MaRDI QIDQ1355686FDOQ1355686

Authors: Matić-Kekić, D. Acketa 

Publication date: 28 May 1997

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 988752
• An exact construction of digital convex polygons with minimal diameter
• The minimal size of a square which includes a digital convex 2K–gon
• scientific article; zbMATH DE number 1444450

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Integer programming (90C10) Discrete geometry (52C99)

Cited In (7)

• Efficient Algorithms to Test Digital Convexity
• Title not available (Why is that?)
• On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid
• Title not available (Why is that?)
• Title not available (Why is that?)
• The minimal size of a square which includes a digital convex 2K–gon
• Asymptotics for the maximal number of edges of a digital convex arc

This page was built for publication: Non-greedy optimal digital convex polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1355686)