Search code examples
javaalgorithmimage-processingdata-structureskdtree

Suitable data structure

I have a Image (appx 1000 x 1000) and a set of small images each 10 x 10.

I created a (3 dimensions tree) for storing the HSL values of each tile.I get an array-list of tile RGB values that is closest to the HSL of a particular grid in the target image.

The problem is I don't know to which smaller image that particular HSL in the array list belongs to. I have a small image class which stores Number of times the small image was reused. I need to access these fields to determine which tile I could use.

Is there a way I could take the array-list of small image HSL that I got and get the small image information.

Solution

  • The KdTree you referenced works on any class derived from KdTree.XYZPoint. So the elegant way would be to either derive your tile class from KdTree.XYZPoint or create a new class derived from KdTree.XYZPoint that has a reference to the corresponding tile object.