Subject: [ggl] Relational Algorithms
From: Joshua Anghel (janghel)
Date: 2010-05-06 17:19:21
Has there been any progress recently towards fully implementing the
remaining OGC Boolean relations, such as contains, crosses, touches, etc.
and expanding within and overlaps to be dimensionally agnostic. Also has
there been any work on creating a de9im generation algorithm. The structures
are setup, but it seems that there is no algorithms for calculating the full
de9im of two geometries or geometry collections, which is necessary for
implementing the OGC relate algorithm.
-------------- next part --------------
An HTML attachment was scrubbed...
Geometry list run by mateusz at loskot.net