In this paper, we show that every Schnyder drawing is a greedy embedding. Schnyder drawings are used to represent planar (maximal) graphs. It is a way of getting coordinates in ${\mathbb{R}}^2$ given a graph $G=(V,E)$ such that the representation is planar. The Schnyder technique leads to a family of representations and previous results show that a particular representation may be chosen such that the drawing has additional properties like being greedy or monotone. In this article, we relax the definition of greediness to a definition that does not rely on the geometry and the Euclidean distance in ${\mathbb{R}}^2$, but rather on the combinatorial graph G. The construction of greedy paths valid for all Schnyder representations shows that, provided the relaxed definition, every Schnyder drawing is a greedy embedding.

在本文中，我们表明每个Schnyder绘图都是贪婪的嵌入。施耐德（Schnyder）图用于表示平面（最大）图。这是获取坐标的一种方法${\mathbb{[R}}^2$ 给定一个图 $G=（V，Ë）$这样表示是平面的。施耐德技术导致了一系列的表示，先前的结果表明可以选择一个特定的表示，使得绘图具有诸如贪婪或单调之类的其他性质。在本文中，我们将贪婪的定义放宽为一个不依赖于几何形状和欧氏距离的定义。${\mathbb{[R}}^2$，而是在组合图G上。对所有Schnyder表示形式均有效的贪婪路径构造表明，只要提供宽松的定义，每个Schnyder绘图都是贪婪的嵌入。