To a given base (ab), triangles are constructed by choosing a point (p).
How can i find the maximum subset-triangles(*)? 
(*)subset-triangle: p' is inside the triangle abp. Allowed interceptions from ap' and bp' with ap and bp are only a, b.
My current solution, needs number-of-points! appends to find the maximum.