In this work we study line arrangements consisting in lines passing through
three non aligned points. We call them triangular arrangements. We prove that
any of this arrangement is associated to another one with the same
combinatorics, constructed by removing lines to a Ceva arrangement. We then
characterize the freeness of such triangular arrangements, which will depend on
the combinatorics of the deleted lines. We give two triangular arrangements
having the same weak combinatorics (that means the same number $t_i$ of points
with multiplicity $i, i\ge 2$), such that one is free but the other one is not.
Finally, we prove that Terao's conjecture holds for triangular arrangement.