Work

A New Heuristic for Rectilinear Crossing Minimization

Year: 2023

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2303.05136

Authors: Doré, François, Formenti, Enrico

Institutions: Centre National de la Recherche Scientifique, Université Côte d'Azur

Language: English

Topic: Data Visualization and Analytics

Subfield: Computer Vision and Pattern Recognition

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4323924016

Cites:

Cited by:

Related to: 10