Lecture 9: Intro to Ray-Tracing & Accelerating Ray-Scene Intersection (58)
jacklishufan
The figure shown on the right have at least one leaf node attached to each internal node and is of a similar structure to the tree representation of Huffman Coding. Is this guaranteed or there can be multiple internal nodes attached to another internal nodes as children? This does not seem obvious because from the previous slide, the subdivision will continue as long as it reduces expected cost.
Unicorn53547
Bur in every subdivision, you only do one split. And each split will give you at least one leaf node and at most one internal node. Based on mu understanding on the algorithm, there wont't be multiple multiple internal nodes attached to another internal nodes as children.
The figure shown on the right have at least one leaf node attached to each internal node and is of a similar structure to the tree representation of Huffman Coding. Is this guaranteed or there can be multiple internal nodes attached to another internal nodes as children? This does not seem obvious because from the previous slide, the subdivision will continue as long as it reduces expected cost.
Bur in every subdivision, you only do one split. And each split will give you at least one leaf node and at most one internal node. Based on mu understanding on the algorithm, there wont't be multiple multiple internal nodes attached to another internal nodes as children.