Here’s a result discovered by Benoît Bertrand and Lucía López de Medrano that I learned from Omar Antolín ( nprofile1qy2hwumn8ghj7un9d3shjtnyd968gmewwp6kyqpqqmshcslmwan3erj3ulczepe8q8a8xdyfkndnk8fudgtg8ccwg6zqfcr0xq (nprofile…r0xq) ).
Pick one vertex of the n-simplex, colour it blue, then consider all 2^n-1 ways to colour the other vertices red or blue, omitting the all-blue colouring.
For each such colouring, collect all the vectors that point from a blue vertex to a red vertex, and form their cone: the set of linear combinations of these vectors with positive coefficients.
Then these 2^n-1 cones will all fit together to form a half-space!
This is what we get for triangles.