Previous |  Up |  Next

Article

References:
[1] ACKETA D.-MATIC-KEKIC S.: A greedy optimal solution for digital convex polygons with minimal area. In: IX conference on applied mathematics, Budva, 1995, pp. 305-311. MR 1350833 | Zbl 0865.68061
[2] ACKETA D.-ŽUNIC J.: On the maximal number of edges of digital convex polygons included into an m x m-grid. J. Combin. Theory Ser. A 69 (1995), 358-368. MR 1313902
[3] ACKETA D.-ŽUNIC J.: A simple construction of a digital convex n-gon with almost minimal diameter. Inform. Sci. 77 (1994), 275-291. MR 1282395
[4] COXETER H. S. M.: Introduction to Geometry. John Wiley and Sons Inc, New York, 1980.
[5] MATIĆ-KEKIĆ S.-ACKETA D. M.-ZUNIC J. D.: An exact construction of digital convex polygons with minimal diameter. Discrete Math, (special volume honouring Paul Erdös) 150 (1996), 303-313. MR 1392739 | Zbl 0848.68109
[6] SIMPSON R. J.: Convex lattice polygons of minimum area. Bull. Austral. Math. Soc. 42 (1990), 353-367. MR 1083272
[7] VOSS K.-KLETTE R.: On the maximal number of edges of a convex digital polygon included into a square. Comput. Artificial Intelligence (former: Počítače a umelá inteligencia) 1 (1982), 549-558.
Partner of
EuDML logo