Editing Wallace–Bolyai–Gerwien theorem (section)

== Notes about the proof ==
First of all, this proof requires an intermediate polygon. In the formulation of the theorem using scissors-congruence, the use of this intermediate can be reformulated by using the fact that scissor-congruences are transitive. Since both the first polygon and the second polygon are scissors-congruent to the intermediate, they are scissors-congruent to one another.

The proof of this theorem is constructive and doesn't require the [[axiom of choice]], even though some other dissection problems (e.g. [[Tarski's circle-squaring problem]]) do need it. In this case, the decomposition and reassembly can actually be carried out "physically": the pieces can, in theory, be [[Jordan curve|cut with scissors]] from paper and reassembled by hand.

Nonetheless, the number of pieces required to compose one polygon from another using this procedure generally far exceeds the minimum number of polygons needed.<ref>{{Cite web|url=http://mathworld.wolfram.com/Dissection.html|title = Dissection}}</ref>