“Sequential point trees” by Dachsbacher, Vogelgsang and Stamminger

  • ©Carsten Dachsbacher, Christian Vogelgsang, and Marc Stamminger

Conference:


Type:


Title:

    Sequential point trees

Presenter(s)/Author(s):



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.

References:


    1. BOTSCH, M., WIRATANAYA, A., AND KOBBELT, L. 2002. Efficient high quality rendering of point sampled geometry. In Rendering Techniques 2002 (Proc. Eurographics Workshop on Rendering), Springer. Google Scholar
    2. CHEN, B., AND NGUYEN, M. X. 2001. Pop: a hybrid point and polygon rendering system for large data. In IEEE Visualization 2001, 45–52. Google ScholarDigital Library
    3. COCONU, L., AND HEGE, H.-C. 2002. Hardware-accelerated point-based rendering of complex scenes. In Rendering Techniques 2002 (Proc. Eurographics Workshop on Rendering), Springer, 41–51. Google Scholar
    4. COHEN, J. D., ALIAGA, D. G., AND ZHANG, W. 2001. Hybrid simplification: combining multi-resolution polygon and point rendering. In IEEE Visualization 2001, 37–44. Google ScholarDigital Library
    5. DEUSSEN, O., COLDITZ, C., STAMMINGER, M., AND DRETTAKIS, G. 2002. Interactive visualization of complex plant ecosystems. In Proc. IEEE Visualization 2002. Google ScholarDigital Library
    6. HOPPE, H., DEROSE, T., DUCHAMP, T., MCDONALD, J., AND STUETZLE, W. 1993. Mesh optimization. In Proceedings of SIGGRAPH 93, Computer Graphics Proceedings, 19–26. Google Scholar
    7. HOPPE, H. 1996. Progressive meshes. In Proceedings of SIGGRAPH 96, Computer Graphics Proceedings, 99–108. Google Scholar
    8. HOPPE, H. 1997. View-dependent refinement of progressive meshes. In Proceedings of SIGGRAPH 97, Computer Graphics Proceedings, 189–198. Google Scholar
    9. KLEIN, R., LIEBICH, G., AND STRASSER, W. 1996. Mesh reduction with error control. In IEEE Visualization ’96, 311–318. Google Scholar
    10. LUEBKE, D., REDDY, M., COHEN, J., VARSHNEY, A., WATSON, B., AND HUEBNER, R. 2002. Level of Detail for 3D Graphics. Morgan Kaufmann. Google Scholar
    11. PAULY, M., GROSS, M., AND KOBBELT, L. 2002. Efficient simplification of point-sampled surfaces. In Proc. IEEE Visualization 2002. Google ScholarDigital Library
    12. PFISTER, H., ZWICKER, M., VAN BAAR, J., AND GROSS, M. 2000. Surfels: Surface elements as rendering primitives. In Proceedings of ACM SIGGRAPH 2000, Computer Graphics Proceedings, 335–342. Google Scholar
    13. REN, L., PFISTER, H., AND ZWICKER, M. 2002. Object space ewa surface splatting: A hardware accelerated approach to high quality point rendering. Computer Graphics Forum (Proc. EUROGRAPHICS 2002 3, 21, 461–470.Google Scholar
    14. RUSINKIEWICZ, S., AND LEVOY, M. 2000. Qsplat: A multiresolution point rendering system for large meshes. In Proceedings of ACM SIGGRAPH 2000, Computer Graphics Proceedings, 343–352. Google Scholar
    15. RUSINKIEWICZ, S., AND LEVOY, M. 2001. Streaming qsplat: A viewer for networked visualization of large, dense models. In 2001 ACM Symposium on Interactive 3D Graphics, 63–68. Google Scholar
    16. SCHAUFLER, G., AND STÜRZLINGER, W. 1996. A three dimensional image cache for virtual reality. Computer Graphics Forum 15, 3 (August), 227–236.Google ScholarCross Ref
    17. SILLION, F. X., DRETTAKIS, G., AND BODELET, B. 1997. Efficient impostor manipulationfor real-time visualization of urban scenery. Computer Graphics Forum 16, 3 (August), 207–218.Google ScholarCross Ref
    18. STAMMINGER, M., AND DRETTAKIS, G. 2001. Interactive sampling and rendering for complex and procedural geometry. In Rendering Techniques 2001: 12th Eurographics Workshop on Rendering, 151–162. Google ScholarDigital Library
    19. WAND, M., FISCHER, M., PETER, I., AUF DER HEIDE, F. M., AND STRASSER, W. 2001. The randomized z-buffer algorithm: Interactive rendering of highly complex scenes. In Proceedings of ACM SIGGRAPH 2001, Computer Graphics Proceedings, 361–370. Google Scholar
    20. WELZL, E. 1991. Smallest enclosing disks (balls and ellipsoids). In New Results and New Trends in Computer Science, H. Maurer, Ed., vol. 555 of Lecture Notes Comput. Sci. Springer-Verlag, 359–370.Google Scholar
    21. ZHANG, H., AND III, K. E. H. 1997. Fast backface culling using normal masks. In Symposium on Interactive 3D Graphics, 103–106, 189. Google Scholar
    22. ZWICKER, M., PFISTER, H., VAN BAAR, J., AND GROSS, M. 2001. Surface splatting. In Proceedings of ACM SIGGRAPH 2001, Computer Graphics Proceedings, 371–378. Google Scholar


ACM Digital Library Publication:



Overview Page: