Výsledky vyhľadávania - "Visibility testing algorithm"

  • Zobrazené výsledky 1 - 14 z 14
Upresniť hľadanie
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5

    Autori: 吳其玲 Wu, Chi-Ling 簡韶逸 a ďalší

    Prispievatelia: 吳其玲 Wu, Chi-Ling 簡韶逸 a ďalší

    Popis súboru: 3324905 bytes; application/pdf

    Relation: [1] T. Mぴoller and E. Haines, Real-Time Rendering, A. K. Peters, Ltd., Natick, MA, USA, 2002. [2] H. Zhang, D. Manocha, T. Hudson, and K. E. Hoff, “Visibility culling using hierarchical occlusion maps,” in Proceedings of the 24th annual conference on Computer graphics and interactive techniques (SIGGRAPH ’97), New York, NY, USA, 1997, pp. 77–88, ACM Press/Addison-Wesley Publishing Co. [3] S. Morein, “ATI Radeon HyperZ Technology,” in Workshop on Graphics Hardware, Hot3D Proceedings, ACM SIGGRAPH/Eurographics, 2000. [4] M. Cox and P. Hanrahan, “Pixel merging for object-parallel rendering: a distributed snooping algorithm,” in Proceedings of the 1993 symposium on Parallel rendering (PRS ’93), New York, NY, USA, 1993, pp. 49–56, ACM Press. [5] J. H. Clark, “Hierarchical geometric models for visible surface algorithms,” Communications ACM, vol. 19, no. 10, pp. 547–554, 1976. [6] T. H. Cormen, C. Stein, R. L. Rivest, and C. E. Leiserson, Introduction to Algorithms, McGraw-Hill Higher Education, 2001. [7] H. Samet, The design and analysis of spatial data structures, Addison- Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1990. [8] L. A. Shirmun, “The cone of normals technique for fast processing of curved patches,” Computer Graphics Forum, vol. 12, no. 3, pp. 261–272, 1993. [9] S. Kumar, D. Manocha, W. Garrett, and M. Lin, “Hierarchical back-face computation,” Computers and Graphics, vol. 23, no. 5, pp. 681–692, 1999. [10] D. Luebke and C. Georges, “Portals and mirrors: simple, fast evaluation of potentially visible sets,” in Proceedings of the 1995 symposium on Interactive 3D graphics (SI3D ’95), New York, NY, USA, 1995, pp. 105–ff., ACM Press. [11] J. M. Airey, J. H. Rohlf, and Jr. F. P. Brooks, “Towards image realism with interactive update rates in complex virtual building environments,” Computer Graphics (1990 Symposium on Interactive 3D Graphics), vol. 24, no. 2, pp. 41–50, 1990. [12] J. M. Airey, Increasing update rates in the building walkthrough system with automatic model-space subdivision and potentially visible set calculations, Ph.D. thesis, 1990, Director-Frederick P. Brooks, Jr. [13] S. J. Teller and C. H. Sequin, “Visibility preprocessing for interactive walkthroughs,” in Proceedings of the 18th annual conference on Computer graphics and interactive techniques (SIGGRAPH ’91), New York, NY, USA, 1991, pp. 61–70, ACM Press. [14] S. J. Teller, Visibility computations in densely occluded polyhedral environments, Ph.D. thesis, Berkeley, CA, USA, 1992. [15] S. Teller and P. Hanrahan, “Global visibility algorithms for illumination computations,” in Proceedings of the 20th annual conference on Computer graphics and interactive techniques (SIGGRAPH ’93), New York, NY, USA, 1993, pp. 239–246, ACM Press. [16] N. Greene, M. Kass, and G. Miller, “Hierarchical Z-buffer visibility,” in Proceedings of the 20th annual conference on Computer graphics and interactive techniques (SIGGRAPH ’93), New York, NY, USA, 1993, pp. 231–238, ACM Press. [17] N. Greene, “Hierarchical polygon tiling with coverage masks,” in Proceedings of the 23rd annual conference on Computer graphics and interactive techniques (SIGGRAPH ’96), New York, NY, USA, 1996, pp. 65–74, ACM Press. [18] F. Xie and M. Shantz, “Adaptive hierarchical visibility in a tiled architecture,” in Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware (HWWS ’99), New York, NY, USA, 1999, pp. 75–84, ACM Press. [19] T. Akenine-Moller and J. Strom, “Graphics for the masses: a hardware rasterization architecture for mobile phones,” ACM Transactions on Graphics, vol. 22, no. 3, pp. 801–808, 2003. [20] T. Aila, V. Miettinen, and P. Nordlund, “Delay streams for graphics hardware,” ACM Transactions on Graphics, vol. 22, no. 3, pp. 792–800, 2003. [21] M. Meissner, “Visibility Driven Rasterization,” Computer Graphics Forum, vol. 20, no. 4, pp. 283–294, 2001. [22] T. Aila and V. Miettinen, dPVS – Reference Manual, Hybrid Holding, Ltd., September 2000. [23] F. Durand, G. Drettakis, J. Thollot, and C. Puech, “Conservative visibility preprocessing using extended projections,” in Proceedings of the 27th annual conference on Computer graphics and interactive techniques (SIGGRAPH ’00), New York, NY, USA, 2000, pp. 239–248, ACM Press/Addison-Wesley Publishing Co. [24] N. Scott, D. Olsen, and E.Gannett, “An Overview of the VISUALIZE fx Graphics Accelerator Hardware,” in Hewlett-Packard Journal, 1998, pp. 28–34. [25] L. Carpenter, “The A-buffer, an antialiased hidden surface method,” in Proceedings of the 11th annual conference on Computer graphics and interactive techniques (SIGGRAPH ’84), New York, NY, USA, 1984, pp. 103–108, ACM Press. [26] A. Fournier E. Fiume and L. Rudolph, “A parallel scan conversion algorithm with anti-aliasing for a general-purpose ultracomputer,” in Proceedings of the 10th annual conference on Computer graphics and interactive techniques (SIGGRAPH ’83), New York, NY, USA, 1983, pp. 141–150, ACM Press. [27] E. Fiume, “Coverage masks and convolution tables for fast area sampling,” Graphical Models and Image Processing (CVGIP), vol. 53, no. 1, pp. 25–30, 1991. [28] L. Carpenter, “The A-buffer, an antialiased hidden surface method,” in Proceedings of the 11th annual conference on Computer graphics and interactive techniques (SIGGRAPH ’84), New York, NY, USA, 1984, pp. 103–108, ACM Press. [29] G. Abram and L. Westover, “Efficient alias-free rendering using bit-masks and look-up tables,” in Proceedings of the 12th annual conference on Computer graphics and interactive techniques (SIGGRAPH ’85), New York, NY, USA, 1985, pp. 53–59, ACM Press. [30] J. Pineda, “A parallel algorithm for polygon rasterization,” Proceedings of the 15th annual conference on Computer graphics and interactive techniques, vol. 22, no. 4, pp. 17–20, 1988. [31] POWERVR, “PowerVR white paper: 3D graphical processing,” 2000. [32] http://www.verilog.com/. [33] http://www.mentor.com/. [34] http://www.synopsys.com/.

  6. 6
  7. 7
  8. 8
  9. 9
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14