An upper bound for nonnegative rank

We provide a nontrivial upper bound for the nonnegative rank of rank-three matrices which allows us to prove that ⌈6n/7⌉ linear inequalities suffice to describe a convex n-gon up to a linear projection.