Hi monks. I search the fastest way to search polygons not merged. I have polygons array at least 10000 EA. Of course I search CPAN. but CPAN didn't have modules I want. I search details on Math::Geometry::Planar or Math::Polygon::Calc.. but there are no my target.. Very simple way is that obtain all points in 1st polygon and check which point is inside of 2nd polygon. but this algorithm is not that good performance and stupid way I think.. Do you have any idea? also If I get some algorithm then how can I check all polygons. Basic way is using two foreach loop like below example. but that example performance is really bad. please give me nice idea.. thank you

foreach my $polygon1(@polygon){
foreach my $polygons2(@polygon){
# algorithm checking polygons not merged or overlapped
}
}
[download]

---

---

• 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.