Fast calculation of Pareto front in Python

Question

I have a set of points in a 3D space, from which I need to find the Pareto frontier. Speed of execution is very important here, and time increases very fast as I add points

Answer 1

I might be a little late here but I experimented with the proposed solutions and it seems that they are failing to return all the Pareto points. I have made a recursive implementation (which is significantly faster) to find the Pareto-front and you can find it at https://github.com/Ragheb2464/preto-front