Hi Larry,
Nice that you found the right matrix.
When relation is commutative,
I usually use the following pattern to avoid computing twice :
if (A.getID() < B.getID()) {
if (A relate B) {
setRelation(A,B)
setRelation(B,A)
}
}
Michaël
Thanks Michaël. I'm using "FF2F0121
Thanks Michaël. I'm using "FF2F01212" for polygons, which seems to work
well, and doesn't break the line or point cases. Calculating the
intersection matrix with relate was slower than just doing intersects, but
I was able to look at my algorithm and add some adjacency caching which
made the who
Well, no matter how many times you slice it, a pizza is always (mostly)
planar :-). The problem with map coloring occurs when you can't draw a
line on a plane from a fixed point on all features to a fixed point on
their adjacent features without the lines crossing. You have to lift the
lines off
