We describe a polynomial time algorithm that takes as input a polygon with axis-parallel sides but irrational vertex coordinates, and outputs a set of as few rectangles as possible into which it can be dissected by axis-parallel cuts and translations. The number of rectangles is the rank of the Dehn invariant of the polygon.

翻译：我们描述一个多边时间算法,它将具有轴-平行边面但非理性的顶点坐标的多边形作为输入,并输出出尽可能少的矩形,通过轴-平行切割和翻译将其分解出来。矩形的数量是多边形的 Dehn 变量的等级。