I don't really understand the time complexity here

motoole2

@hesper The worst case runtime for the Delaunay triangulation of a mesh containing n points/vertices all in a plane (i.e., in 2D) is O(n^2). Fortunately, the expected cost of a Delaunay triangulation is O(n log n) in practice.

I don't really understand the time complexity here

@hesper The worst case runtime for the Delaunay triangulation of a mesh containing

`n`

points/vertices all in a plane (i.e., in 2D) is`O(n^2)`

. Fortunately, the expected cost of a Delaunay triangulation is`O(n log n)`

in practice.