Some questions on partitioning into Triangles

1. For any n, can any triangle be cut into n non-degenerate triangles all of same diameter?

2. If the answer to (1) is yes, can any convex m-gon be cut into some finite number of triangles all of same diameter and if so, can the least number of such triangular pieces be given a lower bound?

Note: Any triangle can be trivially cut into n non degenerate triangles all of same area; it doesn't appear too difficult to cut any triangle into n triangles all of same perimeter either.

3. Can any triangle be cut into some finite number of triangles all of same perimeter?

Ref: https://math.stackexchange.com/questions/2822589/dissect-square-into-triangles-of-same-perimeter
--------------
We can also consider partitioning triangles (and in general, n-gons) into triangles with:
1. equal circumradius
2.rź equal inradius
3. both radii equal
and so on...