Hi all, I'm back working on a task that I discussed here last month (and received the benefit of Martin's tips) to do with finding the minimum distance within compass segment from each of a set of sample points to polygon boundaries. The input data are scarily large, but I hope to be running the job on a 12 core machine so I've based the code around Akka actors.
At the start of the job, polygonal features will be read from a shapefile and inserted into a spatial index (STRtree). Once the index has been constructed it will be passed to a large number of asynchronous actors which will beaver away at the point sampling. Each of these actors will query the tree (using the nearestNeighbour(envelope, geom, distanceOp) method. Lots of concurrent calls in other words. I've seen a few past posts about STRtree not being thread-safe but I have the impression that it should be safe to query concurrently. Can anyone confirm or deny this ? Cheers, Michael ------------------------------------------------------------------------------ CenturyLink Cloud: The Leader in Enterprise Cloud Services. Learn Why More Businesses Are Choosing CenturyLink Cloud For Critical Workloads, Development Environments & Everything In Between. Get a Quote or Start a Free Trial Today. http://pubads.g.doubleclick.net/gampad/clk?id=119420431&iu=/4140/ostg.clktrk _______________________________________________ Jts-topo-suite-user mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/jts-topo-suite-user
