AI Chat AI Image Generator AI Video Text to Speech

RAC-drawability is ∃ℝ-complete

07/24/2021

∙

by Marcus Schaefer, et al.

∙

∙

A RAC-drawing of a graph is a straight-line drawing in which every crossing occurs at a right-angle. We show that deciding whether a graph has a RAC-drawing is as hard as the existential theory of the reals, even if we know that every edge is involved in at most ten crossings and even if the drawing is specified up to isomorphism.

page 1

page 2

page 3

page 4

research

∙ 07/25/2018

A Greedy Heuristic for Crossing Angle Maximization

The crossing angle of a straight-line drawing Γ of a graph G=(V, E) is t...

0 Almut Demel, et al. ∙

research

∙ 09/16/2019

Extending simple drawings with one edge is hard

A simple drawing D(G) of a graph G = (V,E) is a drawing in which two edg...

0 Alan Arroyo, et al. ∙

research

∙ 01/09/2020

RAC Drawings in Subcubic Area

In this paper, we study tradeoffs between curve complexity and area of R...

0 Zahed Rahmati, et al. ∙

research

∙ 08/21/2023

Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs

In a right-angle crossing (RAC) drawing of a graph, each edge is represe...

0 Cornelius Brand, et al. ∙

research

∙ 08/17/2021

Limitations on Realistic Hyperbolic Graph Drawing

We show that several types of graph drawing in the hyperbolic plane requ...

0 David Eppstein, et al. ∙

research

∙ 08/05/2019

Graph Drawing with Morphing Partial Edges

A partial edge drawing (PED) of a graph is a variation of a node-link di...

0 Kazuo Misue, et al. ∙

research

∙ 01/22/2018

INKA: An Ink-based Model of Graph Visualization

Common quality metrics of graph drawing have been about the readability ...

0 Quan Hoang Nguyen, et al. ∙