For maximal planar graphs, in which every face is a triangle, a greedy planar embedding can be found by applying the Knaster–Kuratowski–Mazurkiewicz lemma to a weighted version of a straight-line embedding algorithm of Schnyder.
Nash embedding theorem | Two Greedy Italians | Tutte embedding | Object Linking and Embedding | Greedy algorithm | greedy algorithm |