On speeding up ray tracing of B-spline surfaces
From MaRDI portal
(Redirected from Publication:1109481)
This paper presents an algorithm that has been implemented to speed up the ray tracing of B-spline surfaces. The method uses bounding-box trees instead of the traditional bounding volumes, to effectively reduce the number of time-consuming ray-surface intersection calculations. A bounding-box tree il simple cases, this algorithm reduces the intersection problem to the problem of finding the roots of a single polynomial in one variable of minimal degree. This technique is fast, automatic, efficient and robust.
Recommendations
Cited in
(10)- Realistic computer graphics and free form surfaces
- Extrapolating acceleration algorithms for finding \(B\)-spline intersections using recursive subdivision techniques
- Ray tracing of spline surfaces: Bézier clipping, Chebyshev boxing, and bounding volume hierarchy - a critical comparison with new results
- scientific article; zbMATH DE number 4133542 (Why is no real title available?)
- scientific article; zbMATH DE number 4133547 (Why is no real title available?)
- Ray tracing algorithm based on octree space partition method
- scientific article; zbMATH DE number 645773 (Why is no real title available?)
- Quadric tracing: a geometric method for accelerated sphere tracing of implicit surfaces
- Evaluation of Physical Optics Integrals From B-Spline Surfaces by Means of a Fast Locating Algorithm of Stationary Points
- Real-time rendering of algebraic B-spline surfaces via Bézier point insertion
This page was built for publication: On speeding up ray tracing of B-spline surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109481)