If G is a planar graph, we may add edges to construct a maximal planar graph H containing G, so that H triangulates the sphere. If G is toroidal, then by adding edges we can extend G to a maximal ...

We call a piecewise linear mapping from a planar triangulation to the plane a convex combination mapping if the image of every interior vertex is a convex combination of the images of its neighbouring ...