Kajiya, James T. (1982) Ray tracing parametric patches. California Institute of Technology , Pasadena, CA. (Submitted) http://resolver.caltech.edu/CaltechAUTHORS:20120420-151015498
Full text not available from this repository.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20120420-151015498
This paper describes an algorithm that uses ray t racing techniques to display bivariate polynomial surface patches. A new intersection algorithm is developed which uses ideas from algebraic geometry to obtain a numerical procedure for finding the intersection of a ray and a patch without subdivision. The algorithm may use complex coordinates for the (u, v)-parameters of the patches. The choice of these coordinates makes the computations more uniform, so that there are fewer special cases to be considered. In particular, the appearance and disappearance of silhouette edges can be handled quite naturally. The uniformity of these techniques may be suitable for implementation on either a general purpose pipelined machine, or on special purpose hardware.
|Item Type:||Report or Paper (Technical Report)|
|Additional Information:||Appears in ACM Computer Graphics, Volume 16, Number 3 July 1982, pages 245-254.|
|Group:||Computer Science Technical Reports|
|Subject Keywords:||computer graphics, raster graphics, ray tracing, parametric patches|
|Other Numbering System:|
|Classification Code:||CR CATEGORIES: 1.3.3, 1.3.5, 1.3.7|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Kristin Buxton|
|Deposited On:||01 May 2012 21:14|
|Last Modified:||01 May 2012 21:15|
Repository Staff Only: item control page