I am confused on the recursion part, How are we going to implement it?
jin
Is 'node' here the whole region shown in the diagram? (containing 9 primitives)
jin
I think the recursion can work by running the code segment again on each sides in the lowest-cost partition. So each side will be a node, and if the node contains less than some small number n number of primitives, it can be considered as a leaf (base case). Otherwise, the node is an internal node, so it can be partitioned again and we can recurse on its child sides.
I am confused on the recursion part, How are we going to implement it?
Is 'node' here the whole region shown in the diagram? (containing 9 primitives)
I think the recursion can work by running the code segment again on each sides in the lowest-cost partition. So each side will be a node, and if the node contains less than some small number n number of primitives, it can be considered as a leaf (base case). Otherwise, the node is an internal node, so it can be partitioned again and we can recurse on its child sides.