On Wed, Apr 21, 2010 at 01:42:05PM +0200, Roger Bivand wrote: > So you do not want hclust at all, really. Look at dnearneigh() in spdep, > setting a 100m bound. Then use n.comp.nb() to see which points belong to > which graph component, using perhaps plot.nb with colours to distinguish > the subgraphs.
Well, hclust was useful, once I understood how cutree works. What would be the benefit of dnearneigh(), is it faster?
signature.asc
Description: Digital signature
_______________________________________________ R-sig-Geo mailing list R-sig-Geo@stat.math.ethz.ch https://stat.ethz.ch/mailman/listinfo/r-sig-geo
