@@ -280,3 +280,9 @@ B ∩ E = 1, if the first MultiPolygon is not a subset of the second MultiPolygo
...
@@ -280,3 +280,9 @@ B ∩ E = 1, if the first MultiPolygon is not a subset of the second MultiPolygo
E ∩ I = 2, if the second MultiPolygon is not a subset of the first MultiPolygon, .else .false. (Note this value cannot be 1 or 0.)
E ∩ I = 2, if the second MultiPolygon is not a subset of the first MultiPolygon, .else .false. (Note this value cannot be 1 or 0.)
E ∩ B = 1, if the second MultiPolygon is not a subset of the first MultiPolygon, else .false (Note this value cannot be 0.)
E ∩ B = 1, if the second MultiPolygon is not a subset of the first MultiPolygon, else .false (Note this value cannot be 0.)
E ∩ E = 2
E ∩ E = 2
Next steps:
- We have to know what types of geometries are allowed and whether we can assume the geometries are valid.
- Have a mechanism to calculate the intersection of geometries of dimension .zero with all other geometries
- Return an indicator as to whether that intersection is on a boundary point or an interior point or none. (Note that a geometry of dimension .zero not intersecting with the boundary or interior of another geometry necessarily implies that it does intersect with the exterior of that geometry.) Return the set of intersection points as well.
- Set up tests to calculate the intersection matrices of any geometry with a geometry of dimension zero. Make sure that if the order of the two geometries are reversed that the intersection matrices are transposes of each other.
