Author:
Kay Timothy L.,Kajiya James T.
Abstract
A new algorithm for speeding up ray-object intersection calculations is presented. Objects are bounded by a new type of extent, which can be made to fit convex hulls arbitrarily tightly. The objects are placed into a hierarchy. A new hierarchy traversal algorithm is presented which is efficient in the sense that objects along the ray are queried in an efficient order.Results are presented which demonstrate that our technique is several times faster than other published algorithms. Furthermore, we demonstrate that it is currently possible to ray trace scenes containing hundreds of thousands of objects.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,General Computer Science
Cited by
226 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Light Path Guided Culling for Hybrid Real-Time Path Tracing;Proceedings of the ACM on Computer Graphics and Interactive Techniques;2024-08-09
2. Neural Bounding;Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers '24;2024-07-13
3. Feature-preserving quadrilateral mesh Boolean operation with cross-field guided layout blending;Computer Aided Geometric Design;2024-06
4. Effective caustics simulation for real-time rendering applications;Optoelectronic Imaging and Multimedia Technology X;2023-11-27
5. Building Oriented Bounding Boxes by the intermediate use of ODOPs;Computers & Graphics;2023-11