View frustum culling (Culling Culling)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(n^{2})$

Space Complexity

()

Description

Approximate?

Approximate

Approximation Factor:

Randomized?

No, deterministic

Model of Computation

Year

2008

Reference

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=View_frustum_culling_(Culling_Culling)&oldid=44724"