Jump to content

Talk:Liang–Barsky algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Zaghaghi (talk | contribs) at 19:53, 21 November 2010 (step 2. is incorrect: new section). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Removed code examples

There were previously 3 code examples for Liang-Barsky, 2 in Java and 1 in C#, all of which failed in the case of a line intersecting a rectangle parallel to one of the edges. A correct example in pseudo-code should be added, as per the guidelines in Wikipedia:WikiProject Computer science/Manual of style (computer science). I felt it was better to remove the examples entirely than leave misleading inormation on the page.

step 2. is incorrect

step 2 should be this: If for that k, qk < 0, the line is completely outside and can be eliminated.Zaghaghi (talk) 19:53, 21 November 2010 (UTC)[reply]