My code seems to be decomposing happily now :-)
Probably unlikely, but in case it's any use to anyone or to gt I've
attached the code.
Michael
ps. I'd still be keen to hear how this should really be done !
package org.emilythecamel.jtsutils;
import com.vividsolutions.jts.algorithm.CGAlgorithms;
Hi all,
I've been working on some code that stores a list of rectangles
defining areas of a map that need to be updated prior to servicing the
next data request. The rectangles frequently overlap. Since the map
updating process is time-consuming I looked for an algorithm to
decompose the polygon
