Automatic Bounding Volume Hierarchy Generation Using Stochastic Search Methods
نویسندگان
چکیده
A bounding volume hierarchy is a common method for making ray tracing based rendering more efficient. Constructing good hierarchies, however, is a difficult problem as the number of hierarchies grows exponentially with the number of scene objects. In this paper, we attempted to apply stochastic search to techniques to solve the problem of automatic generation of bounding volume hierarchy. We have investigated the use of randomized constructive search method and the evolutionary algorithm to enhance two prominent heuristics for building bounding volume hierarchies.
منابع مشابه
A survey of algorithms for construction of optimal Heterogeneous Bounding Volume Hierarchies
In this paper we describe algorithms for automatic object hierarchy construction. We also describe a set of properties that hierarchies must possess to be considered optimal. Based on knowledge from existing algorithms we develop and evaluate a Branch and Bound construction algorithm that searches for good hierarchies, but due to computation time, not the globally optimal hierarchy. The algorit...
متن کاملHierarchy Accelerated Stochastic Collision Detection
In this paper we present a new framework for collision and self-collision detection for highly deformable objects such as cloth. It permits to efficiently trade off accuracy for speed by combining two different collision detection approaches. We use a newly developed stochastic method, where close features of the objects are found by tracking randomly selected pairs of geometric primitives, and...
متن کاملImplementing a Photorealistic Rendering System using GLSL
Ray tracing on GPUs is becoming quite common these days. There are many publicly available documents on how to implement basic ray tracing on GPUs for spheres and implicit surfaces. We even have some general frameworks for ray tracing on GPUs. We however hardly find details on how to implement more complex ray tracing algorithms themselves that are commonly used for photorealistic rendering. Th...
متن کاملBounding dissipation in stochastic models
We generalize to stochastic dynamics the exact expression for average dissipation along an arbitrary non-equilibrium process, given in Phys. Rev. Lett. 98, 080602 (2007). We then derive lower bounds by various coarse-graining procedures and illustrate how, when and where the information on the dissipation is captured in models of overand underdamped Brownian particles. PACS numbers: 05.70.Ln, 0...
متن کاملFast Penetration Depth Computation Using Rasterization Hardware and Hierarchical Refinement
We present a novel and fast algorithm to compute penetration depth (PD) between two polyhedral models. Given two overlapping polyhedra, it computes the minimal translation distance to separate them using a combination of object-space and image-space techniques. The algorithm computes pairwise Minkowski sums of decomposed convex pieces, performs closest-point query using rasterization hardware a...
متن کامل