It occurred to me that even better than simply finding all intersections,
would be to set a limit on the number of intersections needed and then
short-circuit out when that limit is hit. That will make the "crazy cat
toy" test much faster (e.g. in the GEOS case the limit could be 1 M instead
of all 90M. This is still plenty high enough to determine there's a
problem).
On Thu, Jan 22, 2015 at 9:16 AM, Martin Davis <[email protected]> wrote:
> Very fast - 160 ms or so. This is just finding the very first
> intersection (which might not even be in the cat-toy section...).
>
>
> On Thu, Jan 22, 2015 at 2:34 AM, Sandro Santilli <[email protected]> wrote:
>
>> On Wed, Jan 21, 2015 at 12:18:35PM -0800, Martin Davis wrote:
>> > Just for grins I ran the test case in
>> http://trac.osgeo.org/geos/ticket/708.
>> > The input linestring has 52,228 points, and it has 97,267,535
>> > self-intersections (computed in 92 s).
>>
>> Nice. How long does it take to find just the first one (for Intersects
>> short-circuiting) ?
>>
>> --strk;
>>
>
>
------------------------------------------------------------------------------
New Year. New Location. New Benefits. New Data Center in Ashburn, VA.
GigeNET is offering a free month of service with a new server in Ashburn.
Choose from 2 high performing configs, both with 100TB of bandwidth.
Higher redundancy.Lower latency.Increased capacity.Completely compliant.
http://p.sf.net/sfu/gigenet
_______________________________________________
Jts-topo-suite-user mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/jts-topo-suite-user
