A greedy heuristic for crossing-angle maximization

DOI10.1007/978-3-030-04414-5_20OpenAlexW2883297081MaRDI QIDQ1725762FDOQ1725762

Marcel Radermacher, Lasse Wulf, Tamara Mchedlidze, Dominik Dürrschnabel, Almut Demel

Publication date: 15 February 2019

Full work available at URL: https://arxiv.org/abs/1807.09483

Mathematics Subject Classification ID

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

Cites Work

• Algorithms for Reporting and Counting Geometric Intersections
• The Crossing-Angle Resolution in Graph Drawing
• Drawing graphs with right angle crossings
• Notes on large angle crossing graphs
• Graphs that admit right angle crossing drawings
• Graph Drawing
• Maximizing the Total Resolution of Graphs
• Bounds on the crossing resolution of complete geometric graphs
• The Straight-Line RAC Drawing Problem is NP-Hard
• Experimental Evaluation of Book Drawing Algorithms
• A Geometric Heuristic for Rectilinear Crossing Minimization

Cited In (5)

• Force-directed layout of order diagrams using dimensional reduction
• Graph Drawing via Gradient Descent, $$(GD)^2$$
• A Geometric Heuristic for Rectilinear Crossing Minimization
• Title not available (Why is that?)
• Stress-Plus-X (SPX) graph layout

This page was built for publication: A greedy heuristic for crossing-angle maximization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1725762)