English: Grid drawing of a A nested triangles graph with 18 vertices. This layout may be used to draw any such graph within a bounding box of dimensions (n/3 + O(1)) × (n/2 + O(1)). This doesn't improve a bound of n/3 × 2n/3 of Frati & Patrignani (2008), because their bound applies more generally to maximal graphs formed by adding diagonals to the quadrilaterals of this graph, and not every maximal graph can be drawn in this way.