Orthogonal dissection into few rectangles

06/21/2022
by   David Eppstein, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset