Talk:Sutherland–Hodgman algorithm

Learn more about this page

This article is rated Stub-class on Wikipedia's content assessment scale.
It is of interest to the following WikiProjects:

Computer graphics

	This article is within the scope of WikiProject Computer graphics, a collaborative effort to improve the coverage of computer graphics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer graphicsWikipedia:WikiProject Computer graphicsTemplate:WikiProject Computer graphicscomputer graphics articles
???	This article has not yet received a rating on the project's importance scale.
	This article has been automatically rated by a bot or other tool as Stub-class because it uses a stub template. Please ensure the assessment is correct before removing the `\|auto=` parameter.

Computing

	This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles
???	This article has not yet received a rating on the project's importance scale.
	This article has been automatically rated by a bot or other tool as Stub-class because it uses a stub template. Please ensure the assessment is correct before removing the `\|auto=` parameter.

Images needed edit

Latest comment: 16 years ago1 comment1 person in discussion

This article would need images to make it easier to understand. Good examples for the images can be found here http://www.cs.drexel.edu/~david/Classes/CS430/Lectures/L-05_Polygons.6.pdf

There is a free image on commons commons:image:Sutherland-Hodgman clipping sample.svg 83.5.93.48 (talk) 12:07, 11 March 2008 (UTC)Reply

Inaccurate algorithm? edit

Latest comment: 14 years ago2 comments1 person in discussion

I'm certain the pseudocode presented here is inaccurate - by testing points for inclusion in the clip plane rather than testing them sequentially against the infinitely-extended clip plane edges (as in the diagrams above), the point of the algorithm is missed and bugs are introduced. For example, the leftmost line on the capital W in the graphical example would be clipped entirely because neither of its endpoints lie within the clip plane; the desired behaviour is, of course, to clip it to two edges of the clip plane as shown.

Unless anyone steps in here to point out an error in my thinking, I'll rewrite the algorithm within the next day or two. Comments? Cooperised (talk) 17:06, 23 June 2009 (UTC)Reply

Algorithm rewritten. I've adopted a loosely object-oriented style for the pseudocode, if anyone hates it they can change it. :-) Cooperised (talk) 10:13, 24 June 2009 (UTC)Reply

Add topic