Ray Tracing Triangular Bezier Patches
Loading...
Date
2001
Journal Title
Journal ISSN
Volume Title
Publisher
Blackwell Publishers Ltd and the Eurographics Association
Abstract
We present a new approach to finding ray-patch intersections with triangular Bernstein-Bezier patches of arbitrary degree. This paper extends and complements on the short presentation17 . Unlike a previous approach which was based on a combination of hierarchical subdivision and a Newton-like iteration scheme21 , this work adapts the concept of Bezier clipping to the triangular domain.The problem of reporting wrong intersections, inherent to the original Bezier clipping algorithm14 , is inves-tigated and opposed to the triangular case. It turns out that reporting wrong hits is very improbable, even close to impossible, in the triangular set-up. A combination of Bezier clipping and a simple hierarchy of nested bounding volumes offers a reliable and accurate solution to the problem of ray tracing triangular Bezier patches.
Description
@article{10.1111:1467-8659.00535,
journal = {Computer Graphics Forum},
title = {{Ray Tracing Triangular Bezier Patches}},
author = {Roth, S. H. Martin and Diezi, Patrick and Gross, Markus H.},
year = {2001},
publisher = {Blackwell Publishers Ltd and the Eurographics Association},
ISSN = {1467-8659},
DOI = {10.1111/1467-8659.00535}
}