Circular right-angle crossing drawings in linear time

DOI10.1016/j.tcs.2016.05.017zbMath1344.68176OpenAlexW2400748517MaRDI QIDQ301590

F. Blanchet-Sadri, M. Dambrine

Publication date: 30 June 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.05.017

zbMATH Keywords

circularRACembeddinggraph algorithmgraph drawinglayoutright angle crossingstraight-line

Mathematics Subject Classification ID

Quadratic programming (90C20) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (6)

Crossing edge minimization in radial outerplanar layered graphs using segment paths ⋮ 1-fan-bundle-planar drawings of graphs ⋮ Gap-Planar Graphs ⋮ Gap-planar graphs ⋮ Beyond Planar Graphs: Introduction ⋮ 2-Layer k-Planar Graphs

Cites Work

• Drawing graphs with right angle crossings
• A characterization of complete bipartite RAC graphs
• Geometric RAC Simultaneous Drawings of Graphs
• The Straight-Line RAC Drawing Problem Is NP-Hard
• 2-Layer Right Angle Crossing Drawings
• Drawing Graphs with Right Angle Crossings
• Right Angle Crossing Graphs and 1-Planarity
• Improved Circular Layouts
• Circular Graph Drawings with Large Crossing Angles
• EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING
• Graph-Theoretic Concepts in Computer Science
• On the Perspectives Opened by Right Angle Crossing Drawings
• Unnamed Item

This page was built for publication: Circular right-angle crossing drawings in linear time