Google Maps V3 by Image Maker - 2013-09-18

QUOTE (lignumaqua @ September 17, 2013 09:24 pm)

QUOTE (Image Maker @ September 17, 2013 02:08 am) Would it be possible to map out FP density in a similar way to the "cache density" currently shown? Is there any efficient way to cluster by the sum of all FPs in the vicinity? One "naive" solution I can imagine would be to add the same cache point to the map 50 times if it has 50FPs, but would this be prohibitively slow? Maybe not on a map

Another idea this morning ...
I can only speculate as to what makes a map solution inappropriate. If it is the number of points being displayed on the map, maybe these can be reduced as follows ...

Of the 5104 caches in my 'unfound' DB, 3731 of them have 4 or fewer FPs (Almost 75%). How about dividing the FPs by 5 and rounding down? Only request display of FP/5 copies of each cache, ignoring all caches with a resulting 0 value?

Concrete example => All my unfound caches together have 27973 FPs. Using the suggested algorithm I end up with 4459 "reduced FPs" - less than the original number of caches.
Doing the same dividing by 4 rather than 5 I end up with 5868 "reduced FPs" - so somewhat more.

Would this solve the map issue or is there an problem with displaying the same cache multiple times at the same point?

Thank you (also for your patience Image may be NSFW.
Clik here to view. )