View Dependent Sequential Point Trees

Sequential point trees provide the state-of-the-art technique for rendering point models, by re-arranging hierarchical points sequentially according to geometric errors running on GPU for fast rendering. This paper presents a view dependent method to augment sequential point trees by embedding the hierarchical tree structures in the sequential list of hierarchical points. By the method, two kinds of indices are constructed to facilitate the points rendering in an order mostly from near to far and from coarse to fine. As a result, invisible points can be culled view-dependently in high efficiency for hardware acceleration, and at the same time, the advantage of sequential point trees could be still fully taken. Therefore, the new method can run much faster than the conventional sequential point trees, and the acceleration can be highly promoted particularly when the objects possess complex occlusion relationship and viewed closely because invisible points would be in a high percentage of the points at finer levels.

[1]  Daniel G. Aliaga,et al.  Hybrid simplification: combining multi-resolution polygon and point rendering , 2001, Proceedings Visualization, 2001. VIS '01..

[2]  Markus H. Gross,et al.  Spectral processing of point-sampled geometry , 2001, SIGGRAPH.

[3]  Leif Kobbelt,et al.  High-quality point-based rendering on modern GPUs , 2003, 11th Pacific Conference onComputer Graphics and Applications, 2003. Proceedings..

[4]  Liviu Coconu,et al.  Hardware-Accelerated Point-Based Rendering of Complex Scenes , 2002, Rendering Techniques.

[5]  George Drettakis,et al.  Interactive Sampling and Rendering for Complex and Procedural Geometry , 2001, Rendering Techniques.

[6]  Renato Pajarola,et al.  Efficient Level-of-details for Point based Rendering , 2003, Computer Graphics and Imaging.

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

[8]  Frederick P. Brooks,et al.  Towards image realism with interactive update rates in complex virtual building environments , 1990, I3D '90.

[9]  Marc Levoy,et al.  QSplat: a multiresolution point rendering system for large meshes , 2000, SIGGRAPH.

[10]  Marc Alexa,et al.  Progressive point set surfaces , 2003, TOGS.

[11]  Matthias Zwicker,et al.  Surfels: surface elements as rendering primitives , 2000, SIGGRAPH.

[12]  Marc Levoy,et al.  Streaming QSplat: a viewer for networked visualization of large, dense models , 2001, I3D '01.

[13]  Friedhelm Meyer auf der Heide,et al.  The randomized z-buffer algorithm: interactive rendering of highly complex scenes , 2001, SIGGRAPH.

[14]  George Drettakis,et al.  Interactive visualization of complex plant ecosystems , 2002, IEEE Visualization, 2002. VIS 2002..

[15]  Markus H. Gross,et al.  Shape modeling with point-sampled geometry , 2003, ACM Trans. Graph..

[16]  Baoquan Chen,et al.  POP: a hybrid point and polygon rendering system for large data , 2001, Proceedings Visualization, 2001. VIS '01..

[17]  Ronald N. Perry,et al.  Simple and Efficient Traversal Methods for Quadtrees and Octrees , 2002, J. Graphics, GPU, & Game Tools.

[18]  Renato Pajarola,et al.  Confetti: object-space point blending and splatting , 2004, IEEE Transactions on Visualization and Computer Graphics.

[19]  Matthias Zwicker,et al.  Surface splatting , 2001, SIGGRAPH.

[20]  Marc Stamminger,et al.  Sequential point trees , 2003, ACM Trans. Graph..

[21]  Renato Pajarola,et al.  Points Reloaded: Point-Based Rendering Revisited , 2004, PBG.

[22]  Seth J. Teller,et al.  Computing the antipenumbra of an area light source , 1992, SIGGRAPH.

[23]  Matthias Zwicker,et al.  Object Space EWA Surface Splatting: A Hardware Accelerated Approach to High Quality Point Rendering , 2002, Comput. Graph. Forum.

[24]  Matthias Zwicker,et al.  Perspective Accurate Splatting , 2004, Graphics Interface.