Graphs with large total angular resolution

DOI10.1007/978-3-030-35802-0_15OpenAlexW2990046945MaRDI QIDQ5918989

Oswin Aichholzer, Yoshio Okamoto, André van Renssen, Daniel Perz, Matias Korman, Irene Parada, Birgit Vogtenhuber

Publication date: 26 October 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

graph drawingNP-hardnessangular resolutioncrossing resolutiontotal angular resolution

Mathematics Subject Classification ID

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

Related Items (3)

The Stub Resolution of 1-planar Graphs ⋮ Graphs with large total angular resolution ⋮ Angular Resolutions: Around Vertices and Crossings

Cites Work

• Drawing graphs with right angle crossings
• On the maximum number of edges in quasi-planar graphs
• A heuristic approach towards drawings of graphs with high crossing resolution
• Maximizing the Total Resolution of Graphs
• The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs
• The Straight-Line RAC Drawing Problem Is NP-Hard
• Drawing Graphs in the Plane with High Resolution
• Notes on large angle crossing graphs

This page was built for publication: Graphs with large total angular resolution