Greiner–Hormann clipping algorithm (Polygon Clipping with Arbitrary Clipping Polygon Polygon Clipping): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n^{2})$ ? == Space Complexity == $O(n^{2})$ auxiliary? words (Needs to keep track of (possibly) $O(n^2)$ intersection points) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1998 == Reference == http://davis.wpi.edu/~matt/courses/clipping/") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O(n^{2})$ | $O(n^{2})$? words | ||
(Needs to keep track of (possibly) $O(n^2)$ intersection points) | (Needs to keep track of (possibly) $O(n^2)$ intersection points) | ||
Latest revision as of 08:41, 10 April 2023
Time Complexity
$O(n^{2})$ ?
Space Complexity
$O(n^{2})$? words
(Needs to keep track of (possibly) $O(n^2)$ intersection points)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word/Real RAM
Year
1998