Martin, I don't think I can use MBRContains because I'm not looking for points in a bounded box.
My points aren't bounded by a box. I'm measuring distances from a point (center of a 1 mile by 1 mile grid square) to 600 other points (coal plants). My problem is calculating 1 billion trig functions (for the great circle distance algorithm). Another person has recommended looking into GIS algorithms. For instance: "surface fitting through sparse data". I need help from an expert in that subject. ... My latest method for calculating tiles is to do it pixel by pixel, and to average the "heat" for pixels that aren't represented by a data point to get a smoother color transition. (Previously I was filling in the tile with rectangles). I think a good GIS/spatial algorithm would do this averaging better and hopefully faster than I'm doing it. -- You received this message because you are subscribed to the Google Groups "Google Maps API V2" 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-api?hl=en.
