Greiner–Hormann clipping algorithm (Polygon Clipping with Arbitrary Clipping Polygon Polygon Clipping)

From Algorithm Wiki

Revision as of 09:41, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

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

Reference

http://davis.wpi.edu/~matt/courses/clipping/

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Greiner–Hormann_clipping_algorithm_(Polygon_Clipping_with_Arbitrary_Clipping_Polygon_Polygon_Clipping)&oldid=47385"