Sequential point trees

  • Authors:
  • Carsten Dachsbacher;Christian Vogelgsang;Marc Stamminger

  • Affiliations:
  • University of Erlangen;University of Erlangen;University of Erlangen

  • Venue:
  • ACM SIGGRAPH 2003 Papers
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.