Crossing-Minimal Point-Set Embedding
This task focuses on minimizing crossings on a given set of points. The input therefore consists of a graph and a set of points (at least as many as vertices of the graph). The goal is to assign the vertices of the graph to the given points, such that the number of crossings in the resulting drawing is as low as possible.
The goal of this project is to develop an algorithm in order to minimize the number of crossings of a graph for a given point set.
Informationen: Dominik Dürrschnabel