smh
unread,Feb 7, 2015, 6:31:30 PM2/7/15Sign in to reply to author
Sign in to forward
You do not have permission to delete messages in this group
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
Remember that kml is merely a geo encoding language, focussed mostly on rendering. It is not a programming language, and not a geo reasoning system. You shouldn't expect it to solve problems (e.g. check arbitrary constraints) for you.
It might be that some implementations of some geo reasoning systems might be able to do this, but I wouldn't depend upon this. (Check geo SPARQL, for example.) Verifying that no points within two given polygons in spherical ordinates are at least a certain distance is an interesting geometric problem. It probably devolves into checking that no pair of edge segments from the two polygond come within that distance. Of course it is also necessary to check that one polygon is not entirely inside the other, which would lead to false negatives if the polygons otherwise satisfied the edge test.
HTH