1 / 23

Clipping & Windowing #2

CS580 Computer Graphics. Clipping & Windowing #2. Sung Yong Shin Dept. of Computer Science KAIST. Contents. 1. Cyrus-Beck Algorithm 1.1 Preliminary 1.2 Basic Idea 1.3 Lian and Barsky’s Algorithm - revisited 2. 3D Clipping. 1. Cyrus-Beck Algorithm. 1.1 Preliminaries.

daktari
Download Presentation

Clipping & Windowing #2

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CS580 Computer Graphics Clipping & Windowing #2 Sung Yong Shin Dept. of Computer Science KAIST

  2. Contents 1. Cyrus-Beck Algorithm 1.1 Preliminary 1.2 Basic Idea 1.3 Lian and Barsky’s Algorithm - revisited 2. 3D Clipping

  3. 1. Cyrus-Beck Algorithm 1.1 Preliminaries

  4. Cyrus-Beck Algorithm(Cont’)

  5. Cyrus-Beck Algorithm(Cont’)

  6. Cyrus-Beck Algorithm(Cont’)

  7. Cyrus-Beck Algorithm(Cont’) What is this ?

  8. Cyrus-Beck Algorithm(Cont’)

  9. Cyrus-Beck Algorithm(Cont’) Recall Liang and Barsky’s algorithm !!!

  10. Cyrus-Beck Algorithm(Cont’) Well, …... now, look at this !!!

  11. Cyrus-Beck Algorithm(Cont’)

  12. 1.2 Basic Idea

  13. Basic Assumption ? The clipping polygon is required to be convex !!! What can you do with a non-convex clipping polygon ?

  14. 1.3 Liang and Barsky’s Algorithm - revisited Basic assumption on the window

  15. Liang and Barsky’s Algorithm – revisited (Cont’)

  16. Liang and Barsky’s Algorithm – revisited (Cont’) Liang and Barsky’s algorithm is a special case of Cyrus and Beck’s !!! Is Cyrus and Beck’s algorithm applicable to 3D-clipping ? Yes !!! why ?

  17. 2. 3D-Clipping Clipping Volumes Parallelepiped Truncated Pyramid

  18. Parallelepiped top yon left right bottom hither Cohen-Sutherland’s & Midpoint Subdivision Algorithms can trivially be extended for 3D-Clipping !!!

  19. Truncated Pyramid H.W. Extend Cohen-Sutherland’s Algorithm for a Truncated Pyramidal Clipping Voume

  20. Clipping in OpenGL

  21. Non-Convex Polyhedron Convex Polyhedron Cyrus-Beck Non-Convex Polyhedron ?

  22. Weiler’s Algorithm

  23. Weiler’s Algorithm (Cont’)

More Related