A Fast KD-Tree Construction Method by Probing the Optimal Splitting Plane Heuristically
暂无分享,去创建一个
In the field of ray-tracing based photo-realistic rendering,kd-tree is used as an important acceleration structure.This paper focuses on the effective construction of kd-tree,and proposes a novel and fast construction method which is based on the binning algorithm.The method is composed of two main steps.Firstly,by analyzing the SAH cost function,the method determines the most-likely sub-span which holds the splitting plane.Secondly,sub-sampling is used on the resulted span to get much better approximation to the optimal splitting plane.Moreover,the paper discusses the exiting schemes on binning termination condition,points out their problems,and proposes a more reasonable termination condition.The experimental results show that the novel approach is effective.Compared with the previous works,it decreases the construction overhead,improves the quality of generated kd-tree,and the construction procedure is more robust as well.