Heuristics for ray tracing using space subdivision
The Visual Computer: International Journal of Computer Graphics
An introduction to ray tracing
An introduction to ray tracing
Raytracing irregular volume data
VVS '90 Proceedings of the 1990 workshop on Volume visualization
On the difficulty of triangulating three-dimensional nonconvex polyhedra.
Discrete & Computational Geometry
An upper bound for conforming Delaunay triangulations
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
A condition guaranteeing the existence of higher-dimensional constrained Delaunay triangulations
Proceedings of the fourteenth annual symposium on Computational geometry
Tetrahedral mesh generation by Delaunay refinement
Proceedings of the fourteenth annual symposium on Computational geometry
Ray shooting and lines in space
Handbook of discrete and computational geometry
Determining the lines through four lines
Journal of Graphics Tools
Multi-level ray tracing algorithm
ACM SIGGRAPH 2005 Papers
Vector field based shape deformations
ACM SIGGRAPH 2006 Papers
Discrete & Computational Geometry
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Fast ray traversal of tetrahedral and hexahedral meshes for direct volume rendering
EUROVIS'06 Proceedings of the Eighth Joint Eurographics / IEEE VGTC conference on Visualization
Accelerating ray tracing using constrained tetrahedralizations
ACM SIGGRAPH 2008 posters
| Hi-index | 0.00 |
In this paper we introduce the constrained tetrahedralization as a new acceleration structure for ray tracing. A constrained tetrahedralization of a scene is a tetrahedralization that respects the faces of the scene geometry. The closest intersection of a ray with a scene is found by traversing this tetrahedralization along the ray, one tetrahedron at a time. We show that constrained tetrahedralizations are a viable alternative to current acceleration structures, and that they have a number of unique properties that set them apart from other acceleration structures: constrained tetrahedralizations are not hierarchical yet adaptive; the complexity of traversing them is a function of local geometric complexity rather than global geometric complexity; constrained tetrahedralizations support deforming geometry without any effort; and they have the potential to unify several data structures currently used in global illumination.