网站大量收购独家精品文档,联系QQ:2885784924

Lecture19-HiddenSurfaceRemoval 计算机图形学ppt课件.ppt

Lecture19-HiddenSurfaceRemoval 计算机图形学ppt课件.ppt

  1. 1、本文档共106页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Lecture19-HiddenSurfaceRemoval 计算机图形学ppt课件

消隐的对象是三维物体。 消隐结果与观察物体有关,也与视点有关。 线框图 消隐图 真实感图形 Z-Buffering Example NOTE: Can draw these shapes in any order z-Buffer (Depth Buffer) z-Buffer z-Buffer (dup) z-Buffer: Render z-Buffer: Render z-Buffer: Render z-Buffer: Render z-Buffer: Render z-Buffer: Render z-Buffer: Render z-Buffer: Render z-Buffer: Render z-Buffer: Render z-Buffer: Render z-Buffer: Render z-Buffer: Render z-Buffer: Render z-Buffer: Render z-Buffer: Render z-Buffer: Render z-Buffer: Render z-Buffer: Render z-Buffer: Render z-Buffer: Render z-Buffer: Render z-Buffer: Render z-Buffer: Render z-Buffer: Render z-Buffer: Render z-Buffer: Render z-Buffer: Render z-Buffer: Render z-Buffer: Rendering (done) z-Buffer: Result z-Buffer: Pros Simple algorithm Handles VSD, incl intersections Complexity is order N, for polygons No polygon processing order required Amenable to parallelization z-Buffer: Cons Memory intensive Hard to do antialiasing, transparency, translucency(半透明), etc Pre-filtering hard Post-filtering, via subpixel operations, possible z-Buffer Algorithm Initialize buffer Set background intensity, color r,g,b Set depth to max (min) values z-Buffer Algorithm As a polygon P is scan converted Calculate depth z(x,y) at each pixel (x,y) being processed Compare z(x,y) with z-Buffer(x,y) Replace z-Buffer(x,y) with z(x,y) if closed to eye z-Buffer Algorithm Convert all polygons Correct image gets generated when done Scan Convert Polygon P Scan Conversion of Polygon P Scan Convert Polygon P (2) Scan Convert Polygon P (3) Scan Convert Polygon P (4) Scan Convert Polygon P (5) Watkins Algorithm - cont If two or more In/Out flags are TRUE, use the plane equations for the polygons to determine which intersected polygon is in front Y = the current scan line X = the intersection point between the scan line and the edges Z is computed using the plane equations If we have non-penetrating polygons, shade wi

文档评论(0)

qiwqpu54 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档