in reply to Speeding up point-in-polygon -- take two
The following shows the output from several runs of a benchmark looking up 5.25 million randomly generated points in a coordinate space of 5000x5000 that contains 1/4 million polygons:
c:\test>569929-b 1 trial of 5,25e6 points in 2.5e5 polys (33.094s total) c:\test>569929-b 1 trial of 5.25e6 points in 2.5e5 polys (36.656s total) c:\test>569929-b 1 trial of 5.25e6 points in 2.5e5 polys (33.250s total) c:\test>569929-b 1 trial of 5.25e6 points in 2.5e5 polys (35.094s total)
The program runs in under 40 seconds and requires ~100MB. No database.
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^2: Speeding up point-in-polygon -- take two (Under 40 seconds!)
by punkish (Priest) on Aug 28, 2006 at 17:31 UTC | |
by BrowserUk (Patriarch) on Aug 28, 2006 at 17:48 UTC | |
by punkish (Priest) on Aug 28, 2006 at 19:24 UTC |