comment on

> It would be interesting to have an example dataset to compare the performance of any forthcoming pure-perl solution with what postgres indexing can do. Or graphic libraries (like you mentioned earlier).

I'm trying not to cross that road. ;)

If you want you can compare it against a trivial bounding-box approach of spatial indexing.

You add 4 indexed columns for each polygon and use the formula from my first post to eliminate candidates°.

A simplistic pure Perl solution would probably imply sorted arrays, slices and hash intersections for the AND clause.

(Doesn't scale well but can handle 10000 polygons easily)

You already created your test sample, I doubt the OP ever will.

Cheers Rolf
_{(addicted to the Perl Programming Language :)

Wikisyntax for the Monastery
FootballPerl is like chess, only without the dice}

°) Nota bene: this doesn't calculate overlaps, it's just a poor man's spatial index to eliminate impossible combinations.

In reply to Re^6: searching polygons not merged by LanX
in thread searching polygons not merged by dideod.yang

Are you posting in the right place? Check out Where do I post X? to know for sure.
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big> <blockquote> <br /> <dd> <dl> <dt> <em> <font> <h1> <h2> <h3> <h4> <h5> <h6> <hr /> <i> <li> <nbsp> <ol> <p> <small> <strike> <strong> <sub> <sup> <table> <td> <th> <tr> <tt> <u> <ul>
Snippets of code should be wrapped in <code> tags not <pre> tags. In fact, <pre> tags should generally be avoided. If they must be used, extreme care should be taken to ensure that their contents do not have long lines (<70 chars), in order to prevent horizontal scrolling (and possible janitor intervention).
Want more info? How to link or How to display code and escape characters are good places to start.


Do you know where your variables are?
	PerlMonks