Skala (convex and non-convex polyhedral window Line Clipping)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(np)$?

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

1996

Reference

https://onlinelibrary.wiley.com/doi/abs/10.1111/1467-8659.1510061