I want to get the minimum element of a kdtree two-dimensional (x, y). The minimum element is one that for every element (x ', y') of kdtree, x
As can be repeated elements x, returns either.
Asked
Active
Viewed 617 times
-1
-
Seems like I'm reading Truncated Data. – Rohit Jain Nov 29 '12 at 12:04
-
What did you try already? I think your question is incomplete as the condition for minimum is missing. Forgot to copy/paste that from the assignment? – maasg Nov 29 '12 at 12:05
-
I have a method minimum () that calls another recursive method minimoRec (Node n), with n equal to the root node, which compares key elements of the right subtree. They do not work as I want, and running through the tree until you find leaf nodes (left or right without children), and once you find them compared – user1848228 Nov 29 '12 at 12:25
-
I have two books describing k-d trees but they do not conver the min() operation. Who needs the minimum element, that usually is not needed. – AlexWien Nov 29 '12 at 17:27
