Fast Ray-Axis Aligned Bounding Box Overlap Tests with Plucker Coordinates
نویسندگان
چکیده
Fast ray-axis aligned bounding box overlap tests can be performed by utilizing Plücker coordinates. This method tests the ray against the edges comprising the silhouette of the box instead of testing against individual faces. Projection of the edges onto a two-dimensional plane to generate the silhouette is not necessary, which simplifies the technique. The method is division-free and successive calculations are independent and consist simply of dot product operations, which permits vectorization. The method does not compute an intersection distance along the ray to the box, but this can be added as an additional step. Storage of Plücker coordinates is unnecessary, permitting integration into existing systems. Test results show the technique’s performance is up to 93% faster than traditional methods if an intersection distance is not needed.
منابع مشابه
Fast Ray/Axis-Aligned Bounding Box Overlap Tests using Ray Slopes
The original paper [EGMM07] is available at http://jgt.akpeters.com. This paper proposes a new method for fast ray/axis-aligned bounding box overlap tests. This method tests the slope of a ray against an axisaligned bounding box by projecting itself and the box onto the three planes orthogonal to the world-coordinate axes and performs the tests on them separately. The method is division-free an...
متن کاملA Ray Tracing Accelerator Based on a Hierarchy of 1D Sorted Lists
Since the introduction of ray tracing as a rendering technique, several approaches have been proposed to reduce the number of ray/object intersection tests. This paper presents yet another such approach based on a hierarchy of ID sorted lists. A bounding box aligned with the axes encloses an object. The coordinates of each bounding box are ordered in three sorted lists (one for each axis) and a...
متن کاملRapid and Accurate Contact Determination between Spline Models using ShellTrees
In this paper, we present an e cient algorithm for contact determination between spline models. We make use of a new hierarchy, called ShellTree, that comprises of spherical shells and oriented bounding boxes. Each spherical shell corresponds to a portion of the volume between two concentric spheres. Given large spline models, our algorithm decomposes each surface into B ezier patches as part o...
متن کاملRobust BVH Ray Traversal
Most axis-aligned bounding-box (AABB) based BVH-construction algorithms are numerically robust; however, BVH ray traversal algorithms for ray tracing are still susceptible to numerical precision errors. We show where these errors come from and how they can be efficiently avoided during traversal of BVHs that use AABBs.
متن کاملRobust BVH Ray Traversal - revised
Most axis-aligned bounding-box (AABB) based BVH-construction algorithms are numerically robust; however, BVH ray traversal algorithms for ray tracing are still susceptible to numerical precision errors. We show where these errors come from and how they can be efficiently avoided during traversal of BVHs that use AABBs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Graphics, GPU, & Game Tools
دوره 9 شماره
صفحات -
تاریخ انتشار 2004