Abstrac t . A graph is minimum weight drawable if it admits a straightline drawing that is a minimum weight triangulation of the set of points representing the vertices of the graph. In this paper we consider the problem of characterizing those graphs that are minimum weight draw~ble. Our contribution is twofold: We show that there exist infinitely many triangulations that are not minimum weigh...
