Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 222,933,255 papers from all fields of science
Search
Sign In
Create Free Account
RAC drawing
In graph drawing, a RAC drawing of a graph is a drawing in which the vertices are represented as points, the edges are represented as straight line…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
1-planar graph
Angular resolution (graph drawing)
Bend minimization
Fáry's theorem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
L-visibility drawings of IC-planar graphs
G. Liotta
,
F. Montecchiani
Information Processing Letters
2015
Corpus ID: 399605
2013
2013
Circular Graph Drawings with Large Crossing Angles
H. R. Dehkordi
,
Q. Nguyen
,
P. Eades
,
Seok-Hee Hong
Workshop on Algorithms and Computation
2013
Corpus ID: 8789951
This paper is motivated by empirical research that has shown that increasing the angle of edge crossings reduces the negative…
Expand
2012
2012
2-Layer Right Angle Crossing Drawings
Emilio Di Giacomo
,
W. Didimo
,
P. Eades
,
G. Liotta
Algorithmica
2012
Corpus ID: 253980558
A 2-layer drawing represents a bipartite graph where each vertex is a point on one of two parallel lines, no two vertices on the…
Expand
2011
2011
Geometric Simultaneous RAC Drawings of Graphs
E. Argyriou
,
M. Bekos
,
M. Kaufmann
,
A. Symvonis
arXiv.org
2011
Corpus ID: 9562692
In this paper, we introduce and study "geometric simultaneous RAC drawing problems", i.e., a combination of problems on geometric…
Expand
2010
2010
On Drawing Graphs With Right Angle Crossings
R. Fulek
,
Balázs Keszegh
,
Filip Moric
2010
Corpus ID: 120152186
Review
2009
Review
2009
1-Bend RAC Drawings of NIC-Planar Graphs in Quadratic Area
S. Chaplick
,
A. Wolff
2009
Corpus ID: 165162050
A drawing of a graph is called 1-planar if every edge is crossed at most once. A 1-planar drawing is called independent-crossing…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE