Finding Pareto Frontier

Problem statement

Given $N$ points $x_i$ in $d$ dimensional space, find the set of points such that you cannot make improvement on any dimension without decreasing other dimensions. In other words, these sets of point do not dominate each other.

Algorithm

References

• StackOverflow Fast calculation of Pareto front in Python