Sequential point trees

In this paper we present sequential point trees, a data structure that allows adaptive rendering of point clouds completely on the graphics processor. Sequential point trees are based on a hierarchical point representation, but the hierarchical rendering traversal is replaced by sequential processing on the graphics processor, while the CPU is available for other tasks. Smooth transition to triangle rendering for optimized performance is integrated. We describe optimizations for backface culling and texture adaptive point selection. Finally, we discuss implementation issues and show results.

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

[2]  Hermann A. Maurer,et al.  New Results and New Trends in Computer Science , 1991, Lecture Notes in Computer Science.

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

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

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

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

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

[8]  Hugues Hoppe,et al.  View-dependent refinement of progressive meshes , 1997, SIGGRAPH.

[9]  George Drettakis,et al.  Efficient Impostor Manipulation for Real‐Time Visualization of Urban Scenery , 1997, Comput. Graph. Forum.

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

[11]  Wolfgang Stuerzlinger,et al.  A Three Dimensional Image Cache for Virtual Reality , 1996, Comput. Graph. Forum.

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

[13]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.

[14]  Reinhard Klein,et al.  Mesh reduction with error control , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

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

[16]  Tony DeRose,et al.  Mesh optimization , 1993, SIGGRAPH.

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

[18]  Markus H. Gross,et al.  Efficient simplification of point-sampled surfaces , 2002, IEEE Visualization, 2002. VIS 2002..

[19]  Jung Hong Chuang.  Level of Detail for 3D Graphics , 2002 .

[20]  Emo Welzl,et al.  Smallest enclosing disks (balls and ellipsoids) , 1991, New Results and New Trends in Computer Science.

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

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

[23]  Leif Kobbelt,et al.  Efficient High Quality Rendering of Point Sampled Geometry , 2002, Rendering Techniques.