#9 Scan Conversion amp; Midterm Review.ppt

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

#9: Scan Conversion Midterm Review CSE167: Computer Graphics Instructor: Ronen Barzel UCSD, Winter 2006 Outline for Today Rendering intro Culling clipping Scan conversion Midterm review Rendering Fancier term: Image Synthesis Synthesis of a 2D image from a 3D scene description Result is a 2D array of pixels Red, Green, Blue values (range 0-255 or 0.0-1.0) Can also have: opacity (“alpha”), depth (“Z”), … Rasterization = determining which pixels are drawn by a given object Hardware vs. Software Rendering Highest quality rendering is done by software Algorithms such as “ray tracing”, “photon maps”, etc… Fanciest lighting, shadowing, surface shading, smoke fog, etc. Can take minutes or hours to compute an image RenderMan (Pixar), Dali (Henrik Wann Jensen), RADIANCE, POVRay, … Modern computers often have special-purpose 3D rendering hardware. “GPU” == Graphics Processing Unit. (Nvidia, ATI) Hardware implements the traditional 3D graphics rendering pipeline Very fast, but relatively simple algorithm: Limits ability to get subtle shadows, reflections, etc. Limits on complexity of surface shading description, etc. Continually improving, driven by games industry. (Modern graphics hardware is programmable, blurring the distinction between hardware software rendering.) We will start with algorithms that are used by GPUs, but we’ll do them in software. 3-D Graphics Rendering Pipeline Rendering Triangle Sets Will focus on triangles for now Most basic and useful Algorithms also for lines, points, polygons, circles, ellipses, … Assume we have colors I.e., colors assigned per-vertex Next week we’ll look at lighting We’ve already done culling Assume we’ve already culled to the view volume: We’ve tossed out objects that we know are outside the view Does that mean everything that remains will be drawn…? More culling, and clipping The view volume culling may have been coarse ? per-triangle view volume culling Some triangles may intersect the edge of the view vol

文档评论(0)

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

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

1亿VIP精品文档

相关文档