Triangle scan conversion using 2D homogeneous coordinates
HWWS '97 Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware
An optimized soft shadow volume algorithm with real-time performance
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Soft shadow volumes for ray tracing
ACM SIGGRAPH 2005 Papers
Soft irregular shadow mapping: fast, high-quality, and robust soft shadows
Proceedings of the 2009 symposium on Interactive 3D graphics and games
Efficient ray traced soft shadows using multi-frusta tracing
Proceedings of the Conference on High Performance Graphics 2009
Sample based visibility for soft shadows using alias-free shadow maps
EGSR'08 Proceedings of the Nineteenth Eurographics conference on Rendering
EGSR'04 Proceedings of the Fifteenth Eurographics conference on Rendering Techniques
| Hi-index | 0.00 |
A key problem in applications such as soft shadows and defocus blur is to identify points or primitives which are inside a volume of space. For example, the soft shadow computation involves finding surfaces which pass in front of an area light as viewed from a point p in the scene. The desired surfaces are those which are inside a frustum defined by the light and p, and can be found by intersecting the frustum with an acceleration structure over geometry. However, accurately computing this intersection is computationally intensive. In this article, we introduce a homogeneous transform which reduces the computation required to determine the set of points or primitives which are inside a tetrahedral volume. The transform converts tetrahedra into axis-aligned boxes, substantially reducing the cost of intersection with an axis-aligned acceleration structure over points or primitives. We describe the application of this transform to soft shadows and defocus blur, and briefly consider potential uses of the underlying mathematical approach in higher-dimensional problems.