Lec05_PolygonClipping.06 计算机图形学ppt课件.pptVIP

下载本文档

8
0
约3.48千字
约 70页
2018-01-28 发布于浙江
举报
版权申诉

Lec05_PolygonClipping.06 计算机图形学ppt课件.ppt

1、有哪些信誉好的足球投注网站（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Lec05_PolygonClipping.06 计算机图形学ppt课件

Spring 2008 CS5600 Spring 08 Utah School of Computing Computer Graphics CS5600 Polygon Clipping CS5600 Computer Graphics Rich Riesenfeld Spring 2006 Ex: Simple Convex Ex: Multiple Components Nonconvex with Many Edges Polygons : Before Clipping Polygons: Clip on Top Polygons: Clip on Right Polygons: Clip on Bottom Polygons: Clip on Left Polygons: Clipped Polygon Begin Animated Recap Polygons: Before Clipping Polygons: Clip on Top Polygons: Clip on Top Polygons: Clip on Right Polygons: Clip on Right Polygons: Clip on Bottom Polygons: Clip on Bottom Polygons: Clip on left Polygons: Clip on left Polygons: Fully Clipped Hodgeman-Sutherland Polygons: Case 1 Case 1: S P both IN Action: Output P Polygons: Case 2 Case 2: S IN; P OUT Action: Output i (S was already output under Case 1) Polygons: Case 3 Case 3: S P both OUT Action: None Polygons: Case 4 Case 4: S OUT; P IN Action: Output i and P Case 1: S P both IN Hodgeman-Sutherland Hodgeman-Sutherland Hodgeman-Sutherland: Top Hodgeman-Sutherland: Top Hodgeman-Sutherland: Bottom Hodgeman-Sutherland: Bottom Hodgeman-Sutherland: Bottom Hodgeman-Sutherland: Right Hodgeman-Sutherland: Left Hodgeman-Sutherland: Left Hodgeman-Sutherland: Left Hodgeman-Sutherland: Done Begin Animated Recap End Animated Recap Hodgeman-Sutherland: Done Hodgeman-Sutherland Problem Correct Result Distinguish Between Case 2 And, Case 4 Distingish Between Case 2 And, Case 4 Extended H-S Algorithm Example of Extended Algo Result Extended H-S Algorithm Connect and as soon as the . is generated Generate next polygon beginning with next , i.e., Another Polygon Clipping Algorithm Weiler-Atherton Clipping Weiler-Atherton Polygon Clipping Another approach to polygon clipping No extra clipping outside window Works for arbitrary shapes Avoids degenerate (退化的)polygons Weiler-Atherton Clipping Gives “Right” Answer Start at first (inside) vertex Traverse polygon until hitting a window boundary Output interse