2000 character limit reached
A New Heuristic for Rectilinear Crossing Minimization
Published 9 Mar 2023 in cs.CG | (2303.05136v2)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.