Skip to main content

Table 2 Complexity analysis of the SP for xEMD algorithms

From: Using Peano–Hilbert space filling curves for fast bidimensional ensemble EMD realization

PHEEMD—SP steps

C(n)

BEMD—SP steps

C(n)

Extrema definition

O(n)

Extrema definition

O(n)

Data extension

O(n)

Data symmetrisation

O(n)

Data interpolation

O(n)

Delaunay training

O(n2)

Data interpolation

O(n2)

Median envelop estimation

O(n)

Median envelop estimation

O(n)

2D > 1D > 2D

O(n)