[R] intersecting polygons

[Richard Rowe]

I have a very much simpler problem - radiotracking data, data limited and 
grubby so anything more than simple convex polygons is unwarranted 
(obtained using chull()).  Distances so small we can regard the Earth as 
flat and Euclidean.

Has anyone a smart idea to detect the (possible) intersection points of two 
such bounding polygons? (once the intersection points are detected then the 
overlap area is another simple convex polygon),

Richard Rowe

Richard Rowe
Senior Lecturer
Department of Zoology and Tropical Ecology, James Cook University
Townsville, Queensland 4811, Australia
fax (61)7 47 25 1570
phone (61)7 47 81 4851
e-mail: Richard.Rowe at jcu.edu.au
http://www.jcu.edu.au/school/tbiol/zoology/homepage.html

-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-
r-help mailing list -- Read http://www.ci.tuwien.ac.at/~hornik/R/R-FAQ.html
Send "info", "help", or "[un]subscribe"
(in the "body", not the subject !)  To: r-help-request at stat.math.ethz.ch
_._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._