کد مقاله کد نشریه سال انتشار مقاله انگلیسی ترجمه فارسی نسخه تمام متن
4952876 1442762 2017 12 صفحه PDF سفارش دهید دانلود کنید
عنوان انگلیسی مقاله
Construction of bounding volume hierarchies with SAH cost approximation on temporary subtrees
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر گرافیک کامپیوتری و طراحی به کمک کامپیوتر
پیش نمایش صفحه اول مقاله
Construction of bounding volume hierarchies with SAH cost approximation on temporary subtrees
چکیده انگلیسی


- BVH construction algorithm with higher quality than state-of-the-art.
- Subquadratic runtime which renders it usable in practice.
- An improved ray tracing performance predictor.

Advances in research on quality metrics for bounding volume hierarchies (BVHs) have shown that greedy top-down SAH builders construct BVHs with superior traversal performance despite the fact that the resulting SAH values are higher than those created by more sophisticated builders. Motivated by this observation we examine three construction algorithms that use recursive SAH values of temporarily constructed SAH-built BVHs to guide the construction and perform an extensive evaluation. The resulting BVHs achieve up to 37% better trace performance for primary rays and up to 32% better trace performance for secondary diffuse rays compared to standard plane sweeping without applying spatial splits. Allowing spatial splits still achieves up to 18% resp. 15% better performance. While our approach is not suitable for real-time BVH construction, we show that the proposed algorithm has subquadratic computational complexity in the number of primitives, which renders it usable in practical applications. Additionally, we describe an approach for improving the forecasting abilities of the SAH-EPO ray tracing performance predictor which also increases its relevance for primary rays.

220

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Graphics - Volume 62, February 2017, Pages 41-52
نویسندگان
, ,