A major factor for the efficiency of ray tracing is the use of good acceleration structures. Recently, bounding volume hierarchies (BVHs) have become the preferred acceleration st...
Stefan Popov, Iliyan Georgiev, Rossen Dimov, Phili...
We propose a new strategy for raytracing complex scenes without aliasing artifacts. The algorithm intersects anisotropic ray cones with prefiltered surface sample points from a mu...
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
Byn Choi, Rakesh Komuravelli, Victor Lu, Hyojin Su...
—Three-dimensional shape matching is a fundamental issue in computer vision with many applications such as shape registration, 3D object recognition, and classification. However,...
Sen Wang, Yang Wang, Miao Jin, Xianfeng David Gu, ...