Welcome! Log In Create A New Profile


2009: Cohen-Sutherland line clipping algorithm

Posted by d-_-b 
Announcements Last Post
Announcement SoC Curricula 09/30/2017 01:08PM
Announcement Demarcation or scoping of examinations and assessment 02/13/2017 07:59AM
Announcement School of Computing Short Learning Programmes 11/24/2014 08:37AM
Announcement Unisa contact information 07/28/2011 01:28PM
2009: Cohen-Sutherland line clipping algorithm
May 20, 2011 09:32PM
In the 2009 exam they asked to give a explanation on the Cohen-Sutherland line clipping algorithm which is on page 331(2006) in our prescribed book. I found the Wikipedia article on Cohen-Sutherland line clipping algorithm very interesting because it gave a c/c++ implementation. Also note the memorandum does not have the not equal(=/=) sign in its description, just nice little blanks so use the prescribed book.

In 2010 they asked to describe the Liang-Barsky algorithm, so I'm also getting suspicious and I do believe we will have to describe at least one of the algorithms in Chapter 7. a quick scanned through Chapter 7 return the following three:

Cohen-Sutherland (page 331)
Liang-Barsky (page 333)
Bresenham (page 346)

Any other algorithm you guys think that would be good to know and understand?
avatar Re: 2009: Cohen-Sutherland line clipping algorithm
July 05, 2011 02:12AM
the GJK algorithm for collision detection is pretty cool
Sorry, only registered users may post in this forum.

Click here to login