On Tue, Feb 07, 2012 at 05:56:52AM -0800, David Fetter wrote:
> On Mon, Feb 06, 2012 at 06:25:33PM -0500, Jay Levitt wrote:
> > I have a rough proof-of-concept for getting nearest-neighbor
> > searches working with cubes.
>
> Please attach such patches to the email when posting them :)
And here's
On Mon, Feb 06, 2012 at 06:25:33PM -0500, Jay Levitt wrote:
> I have a rough proof-of-concept for getting nearest-neighbor
> searches working with cubes.
Please attach such patches to the email when posting them :)
Cheers,
David.
--
David Fetter http://fetter.org/
Phone: +1 415 235 3778 AIM: d
I have a rough proof-of-concept for getting nearest-neighbor searches
working with cubes. When I say "rough", I mean "I have no idea what I'm
doing and I haven't written C for 15 years but I hear it got standardized
please don't hurt me". It seems to be about 400x faster for a 3D cube with
1
