Hi! Here's the situation. I have two sets of ordered coordinates, and with each set, we can draw a line through these coordinates to make a region (polygon). Could it be possible to find where the polygons intersects each other? So basically what we have is two regions, and I want to know where the two different BOUNDARIES intersect with each other.
I figured maybe one could use some simple mathematics, i.e. with javascript choose one line segment and make a corresponding "straight line equation", and then with this line segment loop through the other line segment equations of the OTHER region. Then by seeing where these equations are equal to each other, we can figure out where the lines intersect. Problem is, this is rather memory consuming, isn't it? Concerning that we need to loop through every line segment of each region, and then we also need to verify that the points found actually are lying on our boundaries. (Two straight lines with different slope will always intersect each other at one point, in a mathematical sense.) There must be an easier way out of this. What do you think? -- 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.
