-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Is there a library which is capable of identifying distinct clusters of size n from a series of XY coordinates?
Failing this, I'd like to be able to to something like: Using a sliding window of size n along the x-axis I'd like to determine the distance between the center of the points in the window and the closest point outside the window. I could then use a distance cutoff to help define my clusters of size n. However, how can I calculate this distance? Cheers, Nathan - -- - -------------------------------------------------------- Dr. Nathan S. Watson-Haigh OCE Post Doctoral Fellow CSIRO Livestock Industries Queensland Bioscience Precinct St Lucia, QLD 4067 Australia Tel: +61 (0)7 3214 2922 Fax: +61 (0)7 3214 2900 Web: http://www.csiro.au/people/Nathan.Watson-Haigh.html - -------------------------------------------------------- -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.9 (MingW32) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org iEYEARECAAYFAko1ikEACgkQ9gTv6QYzVL4sUACdGOMLYGaQ0Wkq+ywKD7k+w/kZ WkkAoKPA9RLFNc3nJOX5hR2qPJXfAZ8d =ATd3 -----END PGP SIGNATURE----- ______________________________________________ R-help@r-project.org mailing list https://stat.ethz.ch/mailman/listinfo/r-help PLEASE do read the posting guide http://www.R-project.org/posting-guide.html and provide commented, minimal, self-contained, reproducible code.
