Binary space partitioning (BSP) ( Shown Surface Determination)
Revision as of 10:39, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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 == Reference == https://apps.dtic.mil/dtic/tr/fulltext/u2/700375.pdf")
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