Revisiting the visibility problem with a hybrid structure paradigm

We revisit the problem known as the visibility problem, for computing a potentially visible set of primitives, proposing a solution that can be used to accelerate the processing in real-time 3D visualization applications. We come up with a resulting dry structure in the sense of data reduction that can be used for on-line, interactive applications. Our main goal is to load the minimum amount of primitives from the scene during the rendering stage, as possible. For this purpose, our algorithm executes the culling by using a hybrid paradigm based on viewing-frustum, back-face culling and occlusion models. Results have shown a substantial improvement over these traditional approaches if applied separately. This novel approach can be used in devices with no dedicated processors or with low processing power, as cell phones or embedded displays, or to visualize data through the internet, as in virtual museums applications.