I need an algorithm to decompose a rectilinear polygon into a set of
non-overlapping rectangles. I've looked in JTS but haven't spotted
such a method - if I've overlooked it I'd appreciate someone pointing
me in the right direction.
Apologies for all the self-replies on the this thread...
I now have code that seems to work - slightly more involved than I
previously described after I realized that many configurations will
not have 3 consecutive convex vertices and that I needed to guard
against colinear point in the polygon's boundary.
In case it's of use to anyone, here is the code. I'd also still be
keen to hear how this task should really be done !