Naive algorithm (2-Dimensional Delaunay Triangulation Delaunay Triangulation)
Revision as of 11:52, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{4})$? (previously $O(n^{2})$) == Space Complexity == $O(n)$ words (Keep track of triangles in triangulation, and current triangle being tested) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM? == Year == 1934 == Reference == -")
Time Complexity
$O(n^{4})$? (previously $O(n^{2})$)
Space Complexity
$O(n)$ words
(Keep track of triangles in triangulation, and current triangle being tested)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Real RAM?
Year
1934
Reference
-