4 research outputs found
A Low Dimensional Framework for Exact Polygon-to-Polygon Occlusion Queries
Despite the importance of from-region visibility computation in computer graphics, efficient analytic methods are still lacking in the general 3D case. Recently, different algorithms have appeared that maintain occlusion as a complex of polytopes in Plücker space. However, they suffer from high implementation complexity, as well as high computational and memory costs, limiting their usefulness in practice. In this paper, we present a new algorithm that simplifies implementation and computation by operating only on the skeletons of the polyhedra instead of the multi-dimensional face lattice usually used for exact occlusion queries in 3D. This algorithm is sensitive to complexity of the silhouette of each occluding object, rather than the entire polygonal mesh of each object. An intelligent feedback mechanism is presented that greatly enhances early termination by searching for apertures between query polygons. We demonstrate that our technique is several times faster than the state of the art
Exact From-region Visibility Culling
To pre-process a scene for the purpose of visibility culling during walkthroughs it is necessary to solve visibility from all the elements of a finite partition of viewpoint space. Many conservative and approximate solutions have been developed that solve for visibility rapidly. The idealised exact solution for general 3D scenes has often been regarded as computationally intractable. Our exact algorithm for finding the visible polygons in a scene from a region is a computationally tractable pre-process that can handle scenes of the order of millions of polygons.
The essence of our idea is to represent 3-D polygons and the stabbing lines connecting them in a 5-D Euclidean space derived from Plücker space and then to perform geometric subtractions of occluded lines from the set of potential stabbing lines.We have built a query architecture around this query algorithm that allows for its practical application to large scenes.
We have tested the algorithm on two different types of scene: despite a large constant computational overhead, it is highly scalable, with a time dependency close to linear in the output produced
Hierarchical Level of Detail Optimisation for Constant Framerate Rendering of Radiosity Scenes
The predictive hierarchical level of detail optimization algorithm of Mason and Blake is experimentally evaluated in the form of a practical application to hierarchical radiosity. In a novel approach the recursively subdivided patch hierarchy generated by a perceptually refined hierarchical radiosity algorithm is treated as a hierarchical level of detail scene description. In this way we use the Mason-Blake algorithm to successfully maintain constant frame rates during the interactive rendering of the radiosity-generated scene. We establish that the algorithm is capable of maintaining uniform frame rendering times, but that the execution time of the optimization algorithm itself is significant and is strongly dependent on frame-to-frame coherence and the granularity of the level of detail description. To compensate we develop techniques which effectively reduce and limit the algorithm execution time: We restrict the execution times of the algorithm to guard against pathological situations and propose simplification transforms that increase the granularity of the scene description, at minimal cost to visual quality. We demonstrate that using these techniques the algorithm is capable of maintaining interactive frame rates for scenes of arbitrary complexity. Furthermore we provide guidelines for the appropriate use of predictive level of detail optimization algorithms derived from our practical experience
Accelerating Ray Shooting Through Aggressive 5D Visibility Pre-processing
We present a new approach to accelerating general ray shooting. Our technique uses a five-dimensional ray space partition and is based on the classic ray-classication algorithm. Where the original algorithmevaluates intersection candidates at run-time, our solution evaluates them as a preprocess.
The offline nature of our solution allows for an adaptive subdivision of ray space. The advantage being, that it allows for the placement of a user set upper bound on the number of primitives intersected.
The candidate sets produced account for occlusion, thereby reducing memory requirements and accelerating the ray shooting process. A novel algorithm which exploits graphics hardware is used to evaluate the candidate sets. It is the treatment of occlusion that allows for the practical precomputation of the ray space partition. This algorithm is called aggressive since it is optimal (no invisible primitives are included), but may result in false exclusion of visible primitives. Error is minimised through the adaptive sampling