Talk:Line clipping
From Wikipedia, the free encyclopedia
 |
This article is within the scope of Computing WikiProject, an attempt to build a comprehensive and detailed guide to computers and computing. If you would like to participate, you can edit the article attached to this page, or visit the project page, where you can join the project and/or contribute to the discussion. | |
| ??? | This article has not yet received a rating on the quality scale. | |
| ??? | This article has not yet received an rating on the importance scale. | |
 |
It is requested that a diagram or diagrams be included in this article to improve its quality. For more information, refer to discussion on this page and/or the listing at Wikipedia:Requested images. |
Where is a reference for the efficiency of Liang-Barsky, I was under the impression that it was considerably *less* efficient to do the full problem (should be obvious considering it's a generalisation of the problem to arbitrary clipping regions).
[edit] Code credit?
The pseudocode appears to come from http://www-static.cc.gatech.edu/grads/h/Hao-wei.Hsieh/Haowei.Hsieh/code1.html. I believe they should receive credit on the page. Is there any consensus on this? —The preceding unsigned comment was added by 74.237.230.9 (talk) 12:39, 7 December 2006 (UTC).
[edit] Algorithm explanations
I think the code should be acompanied by an explanations of the algo. Only code doesn't make too much sense. weedrat 11:25, 21 April 2007 (UTC)
Why the hell did the writer choose C sharp anyway? C/C++ is more commonly used and isn't Microsoft-exclusive. 69.124.106.162 04:58, 29 September 2007 (UTC)
-
- C# gives more clean understanding of algorithm than pseudocode
- It can be easily converted to C++ or Java or something else ( by hands or via AST transformation )
- It's not MS-exclusive, see www.mono-project.com. Jack 04:05, 8 October 2007 (UTC)
If it can be so easily converted, convert it into a more commonly used language. 74.196.222.79 (talk) 10:07, 31 March 2008 (UTC)
[edit] Merge/ split
I think the introduction of this article must be either deleted or merged with the mentioned page. Each clipping algorithm should be given a separate page. --Weedrat 08:06, 29 September 2007 (UTC)
I agree. Lakeworks (talk) 13:28, 13 January 2008 (UTC)
Created new articles for Cohen-Sutherland and Liang-Barsky, but failed to remove the content from this page, due to a bot reverting it. Lakeworks (talk) 13:44, 13 January 2008 (UTC)
