Sequential point trees

• Carsten Dachsbacher

  University of Erlangen

• Christian Vogelgsang

  University of Erlangen

• Marc Stamminger

  University of Erlangen

抄録

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.

収録刊行物

• ACM Transactions on Graphics

  ACM Transactions on Graphics 22 (3), 657-662, 2003-07

  Association for Computing Machinery (ACM)

キーワード

• Computer Graphics and Computer-Aided Design

詳細情報

• CRID: 1364233268751169280
• NII論文ID: 30022063358
• DOI: 10.1145/882262.882321
• ISSN: 15577368
• ISSN: 07300301
• Web Site: https://dl.acm.org/doi/pdf/10.1145/882262.882321
• データソース種別:
  • Crossref
  • CiNii Articles