We define and investigate a structure called transversal edge-partition related to triangulations without non empty triangles, which is equivalent to the regular edge labeling discovered by Kant and He. We study other properties of this structure and show that it gives rise to a new straight-line drawing algorithm for triangulations without non empty triangles, and more generally for 4-connected plane graphs with at least 4 border vertices. Taking uniformly at random such a triangulation with 4 border vertices and n vertices, the size of the grid is almost surely $\frac{11}{27}n \times \frac{11}{27}n$up to fluctuations of order $\sqrt{n}$, and the half-perimeter is bounded by n–1. The best previously known algorithms for straight-line drawing of such triangulations only guaranteed a grid of size $(\lceil n/2\rceil - 1)\times \lfloor n/2 \rfloor$. Hence, in comparison, the grid-size of our algorithm is reduced by a factor $\frac{5}{27}$, which can be explained thanks to a new bijection between ternary trees and triangulations of the 4-gon without non empty triangles.