Given a geometric shape of an arc (which can be taken as isosceles triangle )with areaa

- What will be the minimum number of triangles
needed to fill a given areaNA- What could be the maximum sub-area created by
N'>N; a' <= a- Given
give an algorithm to arrange triangles such that it minimizeN'a',

First one shows area a. Second one shows subarea a'=a

Third and fourth are different ways with overlap which has three overlapped areas a1, a2 and a3. Assume that a1>a2>a3. I want to minimize a1.