A LINEAR-TIME SIMPLE BOUNDING VOLUME ALGORITHM
Xiaolin Wu, University of Western Ontario, London, Ontario, Canada
Publisher Summary
Three-dimensional bounding volume is a ubiquitous tool of accelerating ray tracing and visibility testing. The two most common types of bounding volume are box and sphere. That is because the intersections between rays and boxes or rays and spheres involve very simple computations. The smallest bounding volume has received considerable attention in the computational geometry community. The O(N) algorithm for the smallest bounding sphere and the O(N log N) algorithm for the three-dimensional Voronoi diagram exist, and they are both optimal. Simple and fast approximation algorithms for smallest bounding ...
Get Graphics Gems III (IBM Version) now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.