Weiler–Atherton clipping algorithm (Polygon Clipping with Arbitrary Clipping Polygon Polygon Clipping)

From Algorithm Wiki
Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (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 == 1977 == Reference == https://www.cs.drexel.edu/~david/Classes/CS430/HWs/p214-weiler.pdf")
(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})$ 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

1977

Reference

https://www.cs.drexel.edu/~david/Classes/CS430/HWs/p214-weiler.pdf

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