A Geometric Heuristic for Rectilinear Crossing Minimization

DOI10.1137/1.9781611975055.12zbMath1430.68236OpenAlexW2971168062MaRDI QIDQ5232732

Klara Reichard, Marcel Radermacher, Dorothea Wagner, Ignaz Rutter

Publication date: 12 September 2019

Published in: 2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611975055.12

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (6)

Stress-Plus-X (SPX) graph layout ⋮ A greedy heuristic for crossing-angle maximization ⋮ How to Draw a Planarization ⋮ Unnamed Item ⋮ Inserting an edge into a geometric embedding ⋮ Graph Drawing via Gradient Descent, $$(GD)^2$$

This page was built for publication: A Geometric Heuristic for Rectilinear Crossing Minimization