All Questions
3 questions
3
votes
2
answers
232
views
Partition of polygons into 'congruent sets of polygons'
Definition: Two finite sets of polygons $A$ and $B$ are congruent if we can match polygons in $A$ in a one-one manner with polygons in $B$ with each matched pair of polygons mutually congruent.
...
- 5,979
1
vote
1
answer
208
views
On a possible variant of Monsky's theorem
See Wikipedia for Monsky's theorem which states: it is not possible to dissect a square into an odd number of triangles all of equal area.
Questions: Are there quadrilaterals that allow partition into ...
- 5,979
2
votes
1
answer
504
views
Partitioning polygons into acute isosceles triangles
Question: Given an $N$-vertex polygon (not necessarily convex). It is to be cut into the least number of acute isosceles triangles.
Based on this MathSE discussion, one can think of a method to get $\...
- 5,979