Sequential Point Trees
Carsten Dachsbacher, Christian Vogelgsang, Marc Stamminger
In ACM Transactions on Graphics, 22(3), July 2003.
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.
Keyword(s): hardware accelerated graphics, point rendering, level of detail
BibTeX format:
@article{Dachsbacher:2003:SPT,
  author = {Carsten Dachsbacher and Christian Vogelgsang and Marc Stamminger},
  title = {Sequential Point Trees},
  journal = {ACM Transactions on Graphics},
  volume = {22},
  number = {3},
  pages = {657--662},
  month = jul,
  year = {2003},
}
Search for more articles by Carsten Dachsbacher.
Search for more articles by Christian Vogelgsang.
Search for more articles by Marc Stamminger.

Return to the search page.


graphbib: Powered by "bibsql" and "SQLite3."