A New Heuristic for Rectilinear Crossing Minimization

03/09/2023
by   François Doré, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset