The extent to which these remarks explain anything will depend on how comfortable you are with the geometry of vector addition and scalar multiplication. :)
If $p_{1}$, $p_{2}$, and $p_{3}$ are non-collinear points of $\mathbf{R}^{n}$, and if $t_{1}$, $t_{2}$, and $t_{3}$ are real numbers whose sum is unity, then the general point on the plane through the $p_{i}$ is the convex linear combination
\begin{align*}
t_{1} p_{1} + t_{2} p_{2} + t_{3} p_{3}
&= (1 - t_{2} - t_{3}) p_{1} + t_{2} p_{2} + t_{3} p_{3} \\
&= p_{1} + t_{2} (p_{2} - p_{1}) + t_{3} (p_{3} - p_{1}).
\tag{1}
\end{align*}
Geometrically, this expression may be interpreted as the set of positions that can be reached by starting at $p_{1}$ and traveling by arbitrary amounts parallel to $p_{2} - p_{1}$ (the direction from $p_{1}$ to $p_{2}$) and $p_{3} - p_{1}$ (the direction from $p_{1}$ to $p_{3}$).
In your example, the axis intercepts of the plane are
$$
p_{1} = (6, 0, 0), \qquad
p_{2} = (0, -3, 0),\qquad
p_{3} = (0, 0, 2),
$$
and it's straightforward to check every point of the form (1) satisfies $2x - y + 3z = 6$. (One "smart" approach is to check that if $F(x, y, z) = 2x - y + 3z$, then
$$
F(p_{1}) = 6,\qquad
F(p_{2} - p_{1}) = 0 = F(p_{3} - p_{1}),
$$
and that "$F$ respects linear combinations" in the sense that $F(tp + q) = tF(p) + F(q)$ for all points $p$ and $q$, and all real numbers $t$.)
In case it helps, the green region (the triangle with the $p_{i}$ as vertices) is the convex hull of the $p_{i}$, namely, the set of convex linear combinations with all three "weights" non-negative: $t_{i} \geq 0$.