Hai guys, retard here, I'm trying to come up with a fast nearest-neighbour search for RGB colour space and I'm looking into octrees.
The problem is the search will ignore every point not in the same sub-cube (or bin as I think they are called) regardless of how close to the boundary they are. Are there any ways around this?
The problem is the search will ignore every point not in the same sub-cube (or bin as I think they are called) regardless of how close to the boundary they are. Are there any ways around this?
