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. More...
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/LayoutModule.h>
#include <ogdf/basic/basic.h>
#include <ogdf/basic/memory.h>
Go to the source code of this file.
Classes | |
class | ogdf::GeometricEdgeInsertion |
class | ogdf::List< E > |
Doubly linked lists (maintaining the length of the list). More... | |
Namespaces | |
ogdf | |
The namespace for all OGDF objects. | |
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.
Based on the implementation and techniques of the following papers:
Marcel Radermacher, Klara Reichard, Ignaz Rutter, and Dorothea Wagner. Geometric Heuristics for Rectilinear Crossing Minimization. Journal of Experimental Algorithmics 24:1, pages 1.12:1–1.12:21, 2019. doi:10.1145/3325861 .
Marcel Radermacher and Ignaz Rutter. Geometric Crossing Minimization - A Scalable Randomized Approach. In Proceedings of the 27th Annual European Symposium on Algorithms (ESA’19). Ed. by Michael A. Bender, Ola Svensson, and Grzegorz Herman. Leibniz International Proceedings in Informatics (LIPIcs), pages 76:1–76:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. doi: 10.4230/LIPIcs.ESA
Definition in file GeometricEdgeInsertion.h.