Hi. The algorithms in GEOS are almost all ported from the JTS Topology
Suite, fyi.
The reason for not having explicit documentation for algorithm complexity
is time/effort, and difficulty of proving the complexity.
In general the algorithms should be roughly O(n log n) (as opposed to the
O(n^2)
Hi all,
Sorry for disturbing and I hope I am passing through the right channel for my
question. If not, please feel free to redirect me!
I have been searching in the documentation and elsewhere for information
regarding the time complexity of the algorithms of GEOS. More precisely around
the c
