Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Acketa, D.M., Žunić, J.D.: On the maximal number of edges of convex digital polygons included into an m×m-grid. J. Comb. Theory Ser. A 69(2), 358–368 (1995)
2. Andrews, G.E.: A lower bound for the volume of strictly convex bodies with many boundary lattice points. Trans. Amer. Math. Soc. 99, 272–277 (1961)
3. Bárány, I., Rote, G.: Strictly convex drawings of planar graphs. Documenta Math. 11, 369–391 (2006)
4. Lecture Notes in Computer Science;K. Buchin,2010
5. Das, G., Goodrich, M.T.: On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees. Comput. Geom. Theory Appl. 8(3), 123–137 (1997)