Ref:
Partitioning polygons into acute isosceles triangles
Partition of polygons into 'strongly acute' and 'strongly obtuse' triangles
https://math.stackexchange.com/questions/1052063/dividing-an-obtuse-triangle-into-acute-triangles
Question: Is it possible to cut any n-gon into triangles that are both obtuse (largest angle strictly less than 90 degrees) and isosceles? If so how to do it into least number of obtuse isosceles triangles?
Further Question: It easy to see that we can partition any n-gon into triangles that are all obtuse - triangulate the n-gon and divide all resulting acute and right triangles into 3 by connecting each vertex to its Steiner point, resulting in at most 3n obtuse triangles.
Is the 3n a tight upper bound? If not, how can we cut any n-gon into the least number of obtuse triangles? Guess: for convex n-gons, one can do better.