On 13 January 2012 15:47, Rossko <[email protected]> wrote: > > Don't know what your objects are , but here is an approach that may > help.speed it up. > Keep the bounds of all your objects. > First test all the bounds to see if they contain your point - if they > do, they are a possible candidate. > Now check the candidates using slower full point-in-polygon analysis > to find which of the candidates really contain the point.
This is exactly what I do server-side to find a single polygon which contains the point, although it could just as easily find overlapping polygons. That can search 15000 polygons in well under a second, with no geospatial extensions for the database. (I don't display 15000, but I need to know which one to display) Client-side it won't be anything like as fast, if it's possible at all. -- You received this message because you are subscribed to the Google Groups "Google Maps JavaScript API v3" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/google-maps-js-api-v3?hl=en.
