The minimal size of a square which includes a digital convex 2K–gon

DOI10.1017/S0004972700015926MaRDI QIDQ4283039zbMATH OpenWikidataFDO

Authors D. Acketa, Joviša Žunić

Publication date 14 March 1994

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0004972700015926

zbMATH Keywords

digital convex polygon

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27)

Recommendations

• An exact construction of digital convex polygons with minimal diameter
• scientific article; zbMATH DE number 563347
• Non-greedy optimal digital convex polygons
• scientific article; zbMATH DE number 98536
• On the maximal number of edges of convex digital polygons included into an m m-grid

Cites work

• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• On the number of linear partitions of the (m,n)-grid

Cited in

(6)

• On the maximal number of edges of convex digital polygons included into an m m-grid
• Non-greedy optimal digital convex polygons
• An exact construction of digital convex polygons with minimal diameter
• scientific article; zbMATH DE number 792646 (Why is no real title available?)
• Minimal convex \(k\)-gons containing a given convex polygon
• Erdős-Szekeres-type problems in the real projective plane

This page was built for publication: The minimal size of a square which includes a digital convex 2K–gon

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