A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
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 algorithmdoi:10.1109/clei.2015.7359460 dblp:conf/clei/CunhaG15 fatcat:kvhkk267cndynmtnf5wcw2wbce