This post elaborates on a specific instance of Cutting convex polygons into triangles of same diameter .
Question: For any integer n, can any triangle be cut into n non-degenerate triangles all of same diameter (longest side)? If so, can an algorithm be given?
Note: Some further thoughts are recorded at http://nandacumar.blogspot.com/2023/03/some-questions-on-partitioning-into.html .