Displaying 2 results from an estimated 2 matches for "jfolson".
2011 Jun 03
1
Traversing KD-tree (or equivalent) for radius-based search
Hi,
I'm trying to implement the DBSCAN algorithm to get O(N*LogN) complexity
and I'd need a spatial tree of some sort (kd,r,bd..), or a function that
computes radius-based search on spatial data, i.e. given a radius eps
finds ALL the points which fall in the corresponding hypersphere
centered on the current examined point. Is there a package with this
features?
So far I found RANN
2011 Jun 14
1
Calling R from Java
Up, Any helps in this would be really appreciated. I stuck with this.
Regards
--- On Mon, 6/13/11, saleh [via R] <ml-node+3593743-1399725529-244676@n4.nabble.com> wrote:
From: saleh [via R] <ml-node+3593743-1399725529-244676@n4.nabble.com>
Subject: Calling R from Java
To: "saleh" <s.alhammed@yahoo.com>
Date: Monday, June 13, 2011, 12:35 PM
Dear Sir/Madam,
Sorry