Naive algorithm (2-Dimensional Delaunay Triangulation Delaunay Triangulation)

From Algorithm Wiki

Jump to navigation Jump to search

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

-

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Naive_algorithm_(2-Dimensional_Delaunay_Triangulation_Delaunay_Triangulation)&oldid=44836"