## AbstractThis paper presents graph drawing as an optimization problem. Each vertex of the graph is to be represented by a point in the plane, and each edge by a straight line between two points. To evaluate a drawing, an energy function is defined that depends on the coordinates of all the vertices. To find a good drawing, various optimization techniques, such as simulated annealing, can be used. We show a wellknown example of an energy function and describe how it can be modified to become differentiable and thus suitable for minimization using gradient descent. We compare the results of this approach with the results of simulated annealing on several graphs.
[Edit] |