Efficient Bounding of Displaced Bézier Patches
| dc.contributor.author | Munkberg, Jacob | en_US |
| dc.contributor.author | Hasselgren, Jon | en_US |
| dc.contributor.author | Toth, Robert | en_US |
| dc.contributor.author | Akenine-Möller, Tomas | en_US |
| dc.contributor.editor | Michael Doggett and Samuli Laine and Warren Hunt | en_US |
| dc.date.accessioned | 2013-10-28T10:21:33Z | |
| dc.date.available | 2013-10-28T10:21:33Z | |
| dc.date.issued | 2010 | en_US |
| dc.description.abstract | In this paper, we present a new approach to conservative bounding of displaced Bézier patches. These surfaces are expected to be a common use case for tessellation in interactive and real-time rendering. Our algorithm combines efficient normal bounding techniques, min-max mipmap hierarchies and oriented bounding boxes. This results in substantially faster convergence for the bounding volumes of displaced surfaces, prior to tessellation and displacement shading. Our work can be used for different types of culling, ray tracing, and to sort higher order primitives in tiling architectures. For our hull shader implementation, we report performance benefits even for moderate tessellation rates. | en_US |
| dc.description.seriesinformation | High Performance Graphics | en_US |
| dc.identifier.isbn | 978-3-905674-26-2 | en_US |
| dc.identifier.issn | 2079-8687 | en_US |
| dc.identifier.uri | https://doi.org/10.2312/EGGH/HPG10/153-162 | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.subject | Categories and Subject Descriptors (according to ACM CCS): I.3.1 [Computer Graphics]: Hardware Architecture Graphics Processors I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism Hidden line/surface removal | en_US |
| dc.title | Efficient Bounding of Displaced Bézier Patches | en_US |