Vatti clipping algorithm (Polygon Clipping with Arbitrary Clipping Polygon Polygon Clipping)

From Algorithm Wiki
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

1992

Reference

https://dl.acm.org/doi/10.1145/129902.129906