On the maximal number of edges of convex digital polygons included into an m × m-grid
Journal of Combinatorial Theory Series A
Convex drawings of graphs in two and three dimensions (preliminary version)
Proceedings of the twelfth annual symposium on Computational geometry
Embedding planar graphs on the grid
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
The Minimum Area of Convex Lattice n-Gons
Combinatorica
Greedy drawings of triangulations
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Convex drawings of graphs with non-convex boundary constraints
Discrete Applied Mathematics
Succinct strictly convex greedy drawing of 3-connected plane graphs
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
| Hi-index | 0.00 |
Every three-connected planar graph with n vertices has a drawing on an O(n7/3) × O(n7/3) grid in which all faces are strictly convex polygons.