![EVERY END-POINT IS LABELLED WITH THE
APPROPRIATE REGION CODE
wymax
wymin
wxmin wxmax
Window
P3 [0001]
P6 [0000]
P5 [0000]
P7 [0001]
P10 [0100]
P9 [0000]
P4 [1000]
P8 [0010]
P12 [0010]
P11 [1010]
P13 [0101] P14 [0110]](https://image.slidesharecdn.com/sutherlandsalgorithm-171114134005/85/Sutherlands-Cohen-and-Hodgeman-algorithms-13-320.jpg)
![Cohen – Sutherland: Lines in the window
• Lines completely contained within the window boundaries have region code [0000] for
both end-points so are not clipped
wxmin wxmax
wymax
wymin
Window
P3 [0001]
P6 [0000]
P5 [0000]
P7 [0001]
P10 [0100]
P9 [0000]
P4 [1000]
P8 [0010]
P12 [0010]
P11 [1010]
P13 [0101] P14 [0110]](https://image.slidesharecdn.com/sutherlandsalgorithm-171114134005/85/Sutherlands-Cohen-and-Hodgeman-algorithms-14-320.jpg)
![Any lines with a common set bit in the region codes of
both end-points can be clipped
– The AND operation can efficiently check this
wymax
wymin
wxmin wxmax
Window
P3 [0001]
P6 [0000]
P5 [0000]
P7 [0001]
P10 [0100]
P9 [0000]
4P [1000]
P8 [0010]
P12 [0010]
11P [1010]
P13 [0101] P14 [0110]
Cohen – Sutherland: Lines Outside the window](https://image.slidesharecdn.com/sutherlandsalgorithm-171114134005/85/Sutherlands-Cohen-and-Hodgeman-algorithms-15-320.jpg)
Sutherlands Cohen and Hodgeman algorithms
- 1. Clipping Algorithms Cohen & Hodgeman algos Presenter Rohit Jain
- 2. Line Clipping :- ◦ Windowing ◦ Concepts ◦ Clipping ◦ Introduction ◦ Brute Force ◦ Cohen-Sutherland Clipping Algorithm Area Clipping :- ◦ Sutherland-Hodgman Area Clipping Algorithm
- 3. A scene is made up of a collection of objects specified in world coordinates World Coordinates
- 4. When we display a scene only those objects within a particular window are displayed wymax wymin wxmin wxmax Window World Coordinates
- 5. Because drawing things to a display takes time we clip everything outside the window wymax wymin wxmin wxmax World Coordinates Window
- 6. For the image below consider which lines and points should be kept and which ones should be clipped wymax wymin wxmin wxmax P1 Window P6 P5 P3 P7 P10 P9 P4 P 2 P 8
- 7. Easy - a point (x,y) is not clipped if: wxmin≤ x ≤ wxmax AND wymin≤ y ≤ wymax otherwise it is clipped wymax wymin wxmin wxmax Window P1 P2 P5 P10 P4 P8 Clipped Points Within the Window are Not Clipped P9 Clipped Clipped Clipped P7
- 8. HARDER - EXAMINE THE END-POINTS OF EACH LINE TO SEE IF THEY ARE IN THE WINDOW OR NOT Situation Solution Example Both end-points inside the window Don’t clip One end-point inside the window, one outside Must clip Both end-points outside the window Don’t know!
- 9. ◦ Don’t clip lines with both end-points within the window ◦ For lines with one end- point inside the window and one end-point outside, calculate the intersection point (using the equation of the line) and clip from this point out
- 10. ◦ For lines with both end-points outside the window test the line for intersection with all of the window boundaries, and clip appropriately
- 11. • An efficient line clipping algorithm… • The key advantage of the algorithm is that it vastly reduces the number of line intersections that must be calculated… Cohen – Sutherland: Clipping Algorithm
- 12. 0001 0000 Window 0010 0101 0100 0110 World space is divided into regions based on the window boundaries ◦ Each region has a unique four bit region code ◦ Region codes indicate the position of the regions with respect to the window 1001 1000 1010 Top below Right Left 3 2 1 0 Region Code Legend
- 13. EVERY END-POINT IS LABELLED WITH THE APPROPRIATE REGION CODE wymax wymin wxmin wxmax Window P3 [0001] P6 [0000] P5 [0000] P7 [0001] P10 [0100] P9 [0000] P4 [1000] P8 [0010] P12 [0010] P11 [1010] P13 [0101] P14 [0110]
- 14. Cohen – Sutherland: Lines in the window • Lines completely contained within the window boundaries have region code [0000] for both end-points so are not clipped wxmin wxmax wymax wymin Window P3 [0001] P6 [0000] P5 [0000] P7 [0001] P10 [0100] P9 [0000] P4 [1000] P8 [0010] P12 [0010] P11 [1010] P13 [0101] P14 [0110]
- 15. Any lines with a common set bit in the region codes of both end-points can be clipped – The AND operation can efficiently check this wymax wymin wxmin wxmax Window P3 [0001] P6 [0000] P5 [0000] P7 [0001] P10 [0100] P9 [0000] 4P [1000] P8 [0010] P12 [0010] 11P [1010] P13 [0101] P14 [0110] Cohen – Sutherland: Lines Outside the window
- 16. Similarly to lines, areas must be clipped to a window boundary Consideration must be taken as to which portions of the area must be clipped
- 17. A technique for clipping areas developed by Sutherland & Hodgman Put simply the polygon is clipped by comparing it against each boundary in turn Original Area Clip Left Clip Right Clip Top Clip Bottom Sutherland – hodgman Area clipping Algorithm
- 18. To clip an area against an individual boundary: ◦ Consider each vertex in turn against the boundary ◦ Vertices inside the boundary are saved for clipping against the next boundary ◦ Vertices outside the boundary are clipped ◦ If we proceed from a point inside the boundary to one outside, the intersection of the line with the boundary is saved ◦ If we cross from the outside to the inside intersection point and the vertex are saved
- 19. Each example shows the point being processed (P) and the previous point (S) Saved points define area clipped to the boundary in question S Save P S Point I P S No Points Saved P Save Points I & P
- 20. Clipping concave areas can be a little more tricky as often superfluous lines must be removed urve Clipping circles requires more work
- 21. • Objects within a scene must be clipped to display the scene in a window… • Because there are can be so many objects clipping must be extremely efficient… • The Cohen-Sutherland algorithm can be used for line clipping… • The Sutherland-Hodgman algorithm can be used for area clipping…