Search:

Type: Posts; User: lordcoste

Search: Search took 0.00 seconds.

  1. Replies
    6
    Views
    3,953

    kd-tree nearest neighbour

    Hello again, I'm using OpenCL to find the nearest neighbour between two set of 3D points.

    This time I'm using kd-tree for the model.

    First I build the kd-tree and then I pass it to the GPU.
    ...
  2. Replies
    5
    Views
    1,498

    Re: Nearest neighbour (Eucliedean distance)

    I'm working on a new version based on kd-tree.

    Anyway I've got a good answer on how to use local memory with the old algorithm:...
  3. Replies
    5
    Views
    1,498

    Re: Nearest neighbour (Eucliedean distance)

    i'm new to opencl, so my first purpose is to learn, and before implement the kd-tree I would like to know if I'm doing ok the opencl part.

    Also another good reason for implement first the naive...
  4. Replies
    5
    Views
    1,498

    Nearest neighbour (Eucliedean distance)

    Hello, I'm using OpenCL to find the nearest neighbour between two set of 3D points.

    Nearest Neighbour: For each point(x,y,z) in the DataSet I have to find the nearest one in the model. Squared...
Results 1 to 4 of 7