20 Feb
2013
20 Feb
'13
8:42 p.m.
Hi John, On 20-2-2013 20:42, John Lilley wrote:
What types are the intersection and difference algorithms implemented for? In particular:
Can polygons intersect with non-polygons (e.g. point sets to produce clipped point sets, or linestrings to produce clipped linestrings)?
Similar question for difference, where polygon is the second input.
For intersection and difference it is the same. That is, (multi)polygons can intersect with (multi)linestrings (so clip linestrings). But not yet with (multi)points (though that is technically more simple to implement) Regards, Barend