Visibility Preprocessing Using Spherical Sampling of Polygonal Patches

A technique is presented that permits fast view-reconstruction of individual objects. This method improves a previous approach to solve the problem of approximated view reconstruction by combining clustering of polygons with visibility bitfields to determine visibility for novel viewpoints. The technique consists of three steps: patch creation, spherical sampling, and rendering. In the first stage, the input 3D model is tiled in polygonal patches. In the sampling stage images of the model are taken from several points on the surface of a viewing sphere. Patch-ID bitfields, which are structures that contain visibility information, are computed for each picture. In the rendering stage, a subset of the viewpoints computed for sampling is selected depending on the viewers position on the viewing sphere and the bitfields of the selected viewpoints are used to rebuild the visible parts of the model from the new viewpoint. The overall system presented here makes a very efficient use of memory resources, and involves practically no overhead during rendering while significantly improving frame rate during interaction with large models. Although the technique is not conservative, our results show that the reconstructed views are practically identical to the original views of the model.

[1]  Craig Gotsman,et al.  Optimized occlusion culling using five-dimensional subdivision , 1999, Comput. Graph..

[2]  Ken Shoemake,et al.  Arcball Rotation Control , 1994, Graphics Gems.

[3]  Ronald Metoyer,et al.  Real-Time Lighting Changes for Image-Based Rendering , 2022 .

[4]  Paul S. Heckbert,et al.  Survey of Polygonal Surface Simplification Algorithms , 1997 .

[5]  Thomas Strothotte,et al.  Approximated View Reconstruction Using Precomputed ID-Bitfields , 2001, Eurographics.

[6]  Stefan Schlechtweg,et al.  Non-photorealistic computer graphics: modeling, rendering, and animation , 2002 .

[7]  Dani Lischinski,et al.  Automatic camera placement for image-based modeling , 1999, Proceedings. Seventh Pacific Conference on Computer Graphics and Applications (Cat. No.PR00293).

[8]  Hansong Zhang,et al.  Fast backface culling using normal masks , 1997, SI3D.

[9]  Dinesh Manocha,et al.  Visibility culling using hierarchical occlusion maps , 1997, SIGGRAPH.

[10]  David Salesin,et al.  Hierarchical image caching for accelerated walkthroughs of complex environments , 1996, SIGGRAPH.

[11]  Takafumi Saito,et al.  Comprehensible rendering of 3-D shapes , 1990, SIGGRAPH.

[12]  David P. Luebke,et al.  A Developer's Survey of Polygonal Simplification Algorithms , 2001, IEEE Computer Graphics and Applications.

[13]  Enrico Puppo,et al.  Simplification, LOD and MultiresolutionPrinciples and Applications , 1997, Eurographics.

[14]  Manuel Menezes de Oliveira Neto,et al.  Relief texture mapping , 2000, SIGGRAPH.