Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs

In a right-angle crossing (RAC) drawing of a graph, each edge is represented as a polyline and edge crossings must occur at an angle of exactly $90^\circ$, where the number of bends on such polylines is typically restricted in some way. While structural and topological properties of RAC drawings hav...

Full description

Saved in:
Bibliographic Details
Published in:Journal of graph algorithms and applications Vol. 28; no. 2; pp. 131 - 150
Main Authors: Brand, Cornelius, Ganian, Robert, Röder, Sebastian, Schager, Florian
Format: Journal Article
Language:English
Published: 06.11.2024
ISSN:1526-1719, 1526-1719
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first