A new heuristic for rectilinear crossing minimization is proposed. It is based on the idea of iteratively repositioning nodes after a first initial graph drawing. The new position of a node is computed by casting rays from the node towards graph edges. Each ray receives a mark and the one with the best mark determines the new position. The heuristic has interesting performances when compared to the best competitors which can be found in classical graph drawing libraries like OGDF.

翻译：提出了一种用于解决直线交叉最小化问题的新启发式算法。该算法基于在初始图绘制后迭代重定位节点的思想。通过从节点向图中各边发射射线来计算节点的新位置。每条射线都会获得一个评分，并根据评分最优的射线确定新的位置。与OGDF等经典图绘制库中的最优算法相比，该启发式算法表现出令人满意的性能。