Efficient Bounding of Displaced Bézier Patches

By Jacob Munkberg, Jon Hasselgren, Robert Toth, and Tomas Akenine-Möller
Intel Corporation

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.

Read the HPG paper: Efficient Bounding of Displaced Bézier Patches [PDF 4.26MB]

Published previously in "High Performance Graphics," June 2010, and the Lund University Department of Computer Science web site.

In Proceedings of the Conference on High Performance Graphics (HPG '10). pp. 153-162. 2010.

For more complete information about compiler optimizations, see our Optimization Notice.