# How to compute the pareto frontier for dimensions higher than 2?

I'm looking for an intuitive way to compute the pareto frontier for dimensions higher than 2, i.e. a generalization of this (very nice) solution: How to compute the Pareto Frontier, intuitively speaking?

Thanks!

-

You can apply the algorithm in Ilmari's answer recursively. Sort along some direction $x$, and for each value of $x$, beginning with the best, add the $(n-1)$-dimensional Pareto frontier (computed recursively) of the items with that value of $x$ to the $n$-dimensional Pareto frontier, then ignore or remove all items dominated by the added items.