Binary space partitioning (BSP) ( Shown Surface Determination)
Jump to navigation
Jump to search
Time Complexity
$O(n^{2}+p)$? (previously said $O(n^{2}logn)$
Space Complexity
$O(n^{2}+p)$? words?
((can be easily derived?))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM?
Year
1969