SAH Algorithm based on the Minimum Point of the Second Detection
Xuehong Cao · Journal of Nanjing Institute of Technology · 2010
In constructing a KD-tree,splitting plane is chosen by defining the cost function of KD-trees and by locating the splitting plane of current nodes.The method of KD-tree construction and the cost function are studied.By further refining splitting plane,the splitting position of less cost is located.Compared with the former method,the new one can be used to choose a splitting plane which is more reasonable and costs less.The results of the experiments show that the new method is effective.