Advertisement

Journal of Computer Science and Technology

, Volume 21, Issue 2, pp 181–188 | Cite as

View Dependent Sequential Point Trees

  • Wen-Cheng Wang
  • Feng Wei
  • En-Hua Wu
Virtual Reality
  • 26 Downloads

Abstract

Sequential point trees provide the state-of-the-art technique for rendering point models, by re-arranging hierarchical points sequentially according to geometric errors running on GPU for fast rendering. This paper presents a view dependent method to augment sequential point trees by embedding the hierarchical tree structures in the sequential list of hierarchical points. By the method, two kinds of indices are constructed to facilitate the points rendering in an order mostly from near to far and from coarse to fine. As a result, invisible points can be culled view-dependently in high efficiency for hardware acceleration, and at the same time, the advantage of sequential point trees could be still fully taken. Therefore, the new method can run much faster than the conventional sequential point trees, and the acceleration can be highly promoted particularly when the objects possess complex occlusion relationship and viewed closely because invisible points would be in a high percentage of the points at finer levels.

Keywords

view dependence visibility culling GPU point-based rendering real time rendering 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Pfister H, Zwicker M, Van Baar J, Gross M. Surfels: Surface elements as rendering primitives. In Proc. SIGGRAPH′2000, New Orleans, USA, July 23–28, 2000, pp.335–342.Google Scholar
  2. [2]
    Rusinkiewicz S, Levoy M. Qsplat: A multiresolution point rendering system for large meshes. In Proc. SIGGRAPH′2000, New Orleans, USA, July 2000, pp.343–352.Google Scholar
  3. [3]
    Pauly M, Gross M. Spectral processing of point-sampled geometry. In Proc. SIGGRAPH′2001, Los Angeles, California, USA, Aug. 12–17, 2001, pp.379–386.Google Scholar
  4. [4]
    Pauly M, Keiser R, Kobbelt L, Gross M. Shape modeling with point-sampled geometry. In Proc. SIGGRAPH′2003, San Diego, California, USA, July 27–31, 2003, pp.641–650.Google Scholar
  5. [5]
    Ren L, Pfister H, Zwicker M. Object space EWA surface splatting: A hardware accelerated approach to high quality point rendering. In Proc. EUROGRAPHICS′2002, Blaubeuren, Germany, Sept. 9–10, 2002, pp.461–470.Google Scholar
  6. [6]
    Zwicker M, Pfister H, Van Baar J, Gross M. Surface splatting. In Proc. SIGGRAPH′2001, Los Angeles, California, USA, Aug. 12–17, 2001, pp.371–378.Google Scholar
  7. [7]
    Botsch M, Kobbelt L. High-quality point-based rendering on modern GPUs. In Proc. Pacific Graphics′2003, Canmore, Alberta, Canada, Oct. 8–10, 2001, pp.335–346.Google Scholar
  8. [8]
    Pajarola R. Efficient level-of-details for point based rendering. In Proc. 6th IASTED Int. Conf. Computers, Graphics, and Imaging, Honolulu, Hawaii, USA, Aug. 13–15, 2003. http://www.ics.uci.edu/~pajarola/pub/PointLOD.pdf
  9. [9]
    Pajarola R, Sainz M, Guidotti P. Confetti: Object-space point blending and splatting. IEEE Trans. Visualization and Computer Graphics, 2004, 10(5): 598–608.Google Scholar
  10. [10]
    Sainz M, Pajarola R, Lario R. Points reloaded: Point-based rendering revisited. In Proc. Symp. Point-Based Graphics, ETH Zurich, Switzerland, June 2–4, 2004, pp.121–128.Google Scholar
  11. [11]
    Zwicker M, Räsänen J, Botsch M et al. Perspective accurate splatting. In Proc. Graphics Interface′2004, London, Ontario, Canada, May 17–19, 2004, pp.247–254.Google Scholar
  12. [12]
    Chen B, Nguyen M X. Pop: A hybrid point and polygon rendering system for large data. In Proc. IEEE Visualization′2001, San Diego, California, Oct. 21–26, 2001, pp.45–52.Google Scholar
  13. [13]
    Rusinkiewicz S, Levoy M. Streaming Qsplat: A viewer for networked visualization of large, dense models. In Proc. ACM Symp. Interactive 3D Graphics′2001, Research Triangle Park, North Carolina, USA, March 19–21, 2001, pp.63–68.Google Scholar
  14. [14]
    Cohen J D, Aliaga D G, Zhang W. Hybrid simplification: Combining multi-resolution polygon and point rendering. In Proc. IEEE Visualization′2001, San Diego, California, USA, Oct. 21–26, 2001, pp.37–44.Google Scholar
  15. [15]
    Fleishman S, Cohen-Or D, Silva C T. Progressive point set surfaces. ACM Trans. Graphics, 2003, 22(4): 997–1011.CrossRefGoogle Scholar
  16. [16]
    Stamminger M, Drettakis G. Interactive sampling and rendering for complex and procedural geometry. Rendering Techniques′2001 (Proc. Eurographics Workshop on Rendering), London, UK, June 25–27, 2001, pp.151–162.Google Scholar
  17. [17]
    Wand M, Fischer M, Peter I et al. The randomized z-buffer algorithm: Interactive rendering of highly complex scenes. In Proc. SIGGRAPH′2001, Los Angeles, California, USA, Aug. 12–17, 2001, pp.361–370.Google Scholar
  18. [18]
    Coconu L, Hege H C. Hardware-accelerated point-based rendering of complex scenes. In Rendering Techniques′2002 (Proc. Eurographics Workshop on Rendering), Pisa, Italy, June 26–28, 2002, pp.41–51.Google Scholar
  19. [19]
    Deussen O, Colditz C, Stamminger M, Drettakis G. Interactive visualization of complex plant ecosystems. In Proc. IEEE Visualization′2002, Boston, Massachusetts, USA, Oct. 27–Nov. 1, 2002, pp.219–226.Google Scholar
  20. [20]
    Dachsbacher C, Vogelgsang C, Stamminger M. Sequential point Trees. In Proc. SIGGRAPH′2003, San Diego, California, USA, July 27–31, 2003, pp.657–662.Google Scholar
  21. [21]
    Pajarola R, Sainz M, Lario R. EXTreME splatting: External memory multiresolution point visualization. Department of Computer Science, University of California Irvine, 2004, UCI-ICS-04-14.Google Scholar
  22. [22]
    Airey J M, Rohlf J H, Brooks F P Jr. Towards image realism with interactive update rates in complex virtual building environments. Computer Graphics, 1990, 24(2): 41–50.Google Scholar
  23. [23]
    Teller S J. Computing the antipenumbra of an area light source. In Proc. SIGGRAPH′92, Chicago, Illinois, USA, July 26–31, 1992, pp.139–148.Google Scholar
  24. [24]
    Frisken S F, Perry R N. Simple and efficient traversal methods for quadtrees and octrees. J. Graphics Tools, 2002, 7(3): 1–11.Google Scholar
  25. [25]
    Zhang H, Hoff K. Fast backface culling using normal masks. In Proc. ACM Symposium on Interactive 3D Graphics, Providence, RI, USA, April 27-30, 1997, pp.103–106.Google Scholar

Copyright information

© Springer Science + Business Media, Inc. 2006

Authors and Affiliations

  1. 1.State Key Lab of Computer Science, Institute of SoftwareChinese Academy of SciencesBeijingP.R. China
  2. 2.Department of Computer and Information Science, Faculty of Science and TechnologyUniversity of Macau Macao Special Administration RegionP.R. China
  3. 3.Graduate University of Chinese Academy of SciencesBeijingP.R. China

Personalised recommendations