Hello developers
I've been currently working on a python plugin in which I have to find all possible intersections on one layer. I want to improve the efficiency of this task. It roughly looks like this:
for i, geom in enumerate(geoms):
for j, geom in enumerate(geoms):
if j > i:
//intersections
Is there a faster way? Perhaps with multithreading / rtree?
Regards
Johannes Wildermuth
I've been currently working on a python plugin in which I have to find all possible intersections on one layer. I want to improve the efficiency of this task. It roughly looks like this:
for i, geom in enumerate(geoms):
for j, geom in enumerate(geoms):
if j > i:
//intersections
Is there a faster way? Perhaps with multithreading / rtree?
Regards
Johannes Wildermuth
_______________________________________________ QGIS-Developer mailing list [email protected] List info: https://lists.osgeo.org/mailman/listinfo/qgis-developer Unsubscribe: https://lists.osgeo.org/mailman/listinfo/qgis-developer
