Hey everyone.
I'm getting kinda stuck again, and don't really know how to progress. I'm
attempting to speed up an algorithm I'm working on that is using QuadEdges
to represent data, but I can't seem to find a working way to accomplish
this.
I've tried concurrently accessing the subdivision for deletions and
whatnot, but due to the way the LastFoundQuadEdgeLocator works, this isn't
really working (NPEs, etc). My second approach was to split my original set
of data into subsets and then merge the subdivisions back together at the
end, but this seems to be a disgusting amount of work that won't actually
speed anything up. Maybe I'm just going about it the wrong way though.
Does anyone have any idea how I could parallelize something like this, or
at least concurrently access it? I've spent a few too many days getting
nothing done, so I figured I'd ask you guys who actually know what you are
doing.
Thanks.
------------------------------------------------------------------------------
Get 100% visibility into Java/.NET code with AppDynamics Lite!
It's a free troubleshooting tool designed for production.
Get down to code-level detail for bottlenecks, with <2% overhead.
Download for free and get started troubleshooting in minutes.
http://pubads.g.doubleclick.net/gampad/clk?id=48897031&iu=/4140/ostg.clktrk
_______________________________________________
Jts-topo-suite-user mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/jts-topo-suite-user
