Abstract
We find intersections between a ray and a nonplanar bilinear patch using simple geometrical constructs. The new algorithm improves the state of the art performance by over 6× and is faster than approximating a patch with two triangles.
Chapter PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License (http://creativecommons.org/licenses/by-nc-nd/4.0/), which permits any noncommercial use, sharing, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if you modified the licensed material. You do not have permission under this license to share adapted material derived from this chapter or parts of it.
The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
Copyright information
© 2019 NVIDIA
About this chapter
Cite this chapter
Reshetov, A. (2019). Cool Patches: A Geometric Approach to Ray/Bilinear Patch Intersections. In: Haines, E., Akenine-Möller, T. (eds) Ray Tracing Gems. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-4427-2_8
Download citation
DOI: https://doi.org/10.1007/978-1-4842-4427-2_8
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-4426-5
Online ISBN: 978-1-4842-4427-2
eBook Packages: Professional and Applied ComputingApress Access BooksProfessional and Applied Computing (R0)