Abstract
This paper presents a new algorithm for computing the points at which a ray intersects a rational Bezier surface patch, and also an algorithm for determining if an intersection point lies within a region trimmed by piecewise Bezier curves. Both algorithms are based on a recent innovation known as Bezier clipping, described herein. The intersection algorithm is faster than previous methods for which published performance data allow reliable comparison. It robustly finds all intersections without requiring special preprocessing.
Cite
CITATION STYLE
Nishita, T., Sederberg, T. W., & Kakimoto, M. (1990). Ray tracing trimmed rational surface patches. Computer Graphics (ACM), 24(4), 337–345. https://doi.org/10.1145/97880.97916
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.