Cohen–Sutherland (Rectangular Window Line Clipping): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

10 April 2023

15 February 2023

  • curprev 11:3311:33, 15 February 2023‎ Admin talk contribs‎ 410 bytes +410‎ Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ auxiliary words (Easily derived (O(1) per segment, space can be re-used)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1967 == Reference == https://books.google.com/books/about/Principles_of_interactive_computer_graph.html?id=inJ8AAAAIAAJ"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Cohen–Sutherland_(Rectangular_Window_Line_Clipping)"