Ray Tracing Polynomial Tensor Product Surfaces

Simple item page
dc.contributor.authorGiger, Christineen_US
dc.date.accessioned2015-10-05T07:56:07Z
dc.date.available2015-10-05T07:56:07Z
dc.date.issued1989en_US
dc.description.abstractWith regard to ray tracing algorithms for polynomial tensor product surfaces, the most timecritical step is to find an intersection point of a ray and a surface. In this case it proves to be very difficult to decide whether numerical methods will converge to the correct solution. In this paper we present a new method based on numerical algorithms which is suitable to solve the intersection problem. We mention how to force correct convergence and give some information about techniques to speed up the algorithm.en_US
dc.description.seriesinformationEG 1989-Technical Papersen_US
dc.identifier.doi10.2312/egtp.19891009en_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttps://doi.org/10.2312/egtp.19891009en_US
dc.publisherEurographics Associationen_US
dc.titleRay Tracing Polynomial Tensor Product Surfacesen_US
Files
Collections
EG1989 Proceedings (Technical Papers)
EG1989 Proceedings (Technical Papers)