|
file | CrossingMinimalPosition.h [code] |
| Computes a position that induces a minimal number of crossings for a given vertex and straight-line drawing.
|
|
file | GeometricEdgeInsertion.h [code] |
| In the Geometric Edge Insertion Approach we iteratively insert a given set of edges into a drawing of a graph. In each insertion the end vertices are moved to their optimal position. The optimal position can be for example a position that minimizes the number of crossings for this vertex.
|
|
file | GeometricVertexInsertion.h [code] |
| In the Geometric Vertex Insertion Approach we iteratively insert a given set of vertices into a drawing of a graph. Each vertex is placed at its optimal position. The optimal position can be for example a position that minimizes the number of crossings for this vertex.
|
|
file | RandomVertexPosition.h [code] |
| Computes a random position for a given vertex.
|
|
file | VertexMovement.h [code] |
| In the VertexMovement Approach the vertices are moved one by one to its optimal position. The optimal position can be for example a position that minimizes the number of crossings for this vertex.
|
|
file | VertexOrder.h [code] |
| Computes an vertex order based on the number of crossings in a given (straight-line) drawing.
|
|
file | VertexPositionModule.h [code] |
| Optimal Vertex Position interface.
|
|