Computes a position that induces a minimal number of crossings for a given vertex and straight-line drawing. More...
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/basic.h>
#include <ogdf/basic/geometry.h>
#include <ogdf/geometric/VertexPositionModule.h>
#include <random>
Go to the source code of this file.
Classes | |
class | ogdf::CrossingMinimalPosition< FT > |
Compute a crossing minimal position for a vertex. More... | |
class | ogdf::CrossingMinimalPositionApx |
class | ogdf::CrossingMinimalPositionApxWeighted |
Namespaces | |
ogdf | |
The namespace for all OGDF objects. | |
Typedefs | |
using | ogdf::CrossingMinimalPositionFast = CrossingMinimalPosition< double > |
Computes a position that induces a minimal number of crossings for a given vertex and straight-line drawing.
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 CrossingMinimalPosition.h.