期刊文献+

基于最小点二次探测的SAH算法

SAH Algorithm based on the Minimum Point of the Second Detection
下载PDF
导出
摘要 KD-tree构建中,分割平面的选取是通过计算KD-tree的代价函数,启发式地定位当前节点的分割平面.对KD-tree的构建方法进行研究,分析选取分割平面后的代价函数,通过对分割面的进一步细化,找到代价更小的分割位置.与以往方法相比,新方法选取的分割平面更合理,代价函数更小.试验数据验证了新方法的有效性. 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.
出处 《南京工程学院学报(自然科学版)》 2010年第3期15-19,共5页 Journal of Nanjing Institute of Technology(Natural Science Edition)
基金 江苏省自然科学基金(BK2009351) 江苏省高校自然科学基金(07KJB510037)
关键词 光线跟踪 KD-TREE SAH 代价函数 二次探测 ray tracing a KD-tree SAH cost function secondary detection
  • 相关文献

参考文献12

  • 1ANDREW S G An Introduction to Ray Tracing[M].London:Academic Press Lid,1989:33-78. 被引量:1
  • 2BRUCE W,GEORGE D,STEVEN P.Interactive rendering using the render cache rendering techniques[C]//Larson G,Lichinski D.10th Eurngraphics workshop on Rendering,Granada,Spain:Springer-Verlag,1999:235-246. 被引量:1
  • 3BRUE W,GEORGE D,DONALD P G.Enhancing and optimizing the render cache[C]//13th Eurographics Workshop on Rendering,Pisa,Italy,2002:37-42. 被引量:1
  • 4WALD I,HAVRAN V On building fast kd-tree fur ray tracing,and on doing that in O(nlogn)[C]//Proceedings of the IEEE Symposium on Interactive Ray Tracing 2006,Salt Lake City,USA,2006:61 -69. 被引量:1
  • 5LEXT J,ASSARSSON U,MOLLER T.A benchmark for animated ray tracing[J]IEEE Computer Graphics and Application,2001,21 (2):22-31. 被引量:1
  • 6RAVI P K,BENJAMIN M.A study of restricted BSP trees for ray tracing[C]//In Proceedings of the 2007 IEEE/Eurographics Symposium on Interactive Ray Tracing,2007:55 -62. 被引量:1
  • 7MACDONALD J D,BOOT H K S.Heuristics for ray t racing using space subdivision[J].The Visual Computer,1990,6 (3):153-166. 被引量:1
  • 8HAVRAN V.Heuristic ray shooting algorithms[D].Prague:Czech Technical University,2001:49 -67. 被引量:1
  • 9SANTALO L.Integral Geometry and Geometric Probability[M].Cambridge:Cambridge University Press,2004. 被引量:1
  • 10HAVRAN V,BITTNER J.On improving kd-tree for ray shooting[C]//Proceedings of the WSCG' 2002 Conference,Plzen,Czech Republic,2002:209-216. 被引量:1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部