Drawing Graphs with Right Angle Crossings
From MaRDI portal
Recommendations
Cites work
- Discrete and Computational Geometry
- Drawing graphs. Methods and models
- Efficient orthogonal drawings of high degree graphs
- Empirical evaluation of aesthetics-based graph layout
- Graph drawing software
- scientific article; zbMATH DE number 2123122 (Why is no real title available?)
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- Improving the crossing lemma by finding more crossings in sparse graphs
- On the maximum number of edges in quasi-planar graphs
- Quasi-planar graphs have a linear number of edges
- Representations of Planar Graphs
- The maximum number of triangles in arrangements of pseudolines
- Triangles in Euclidean arrangements
Cited in
(23)- New results on drawing angle graphs
- Right angle crossing graphs and 1-planarity
- Circular right-angle crossing drawings in linear time
- Graphs that admit right angle crossing drawings
- The straight-line RAC drawing problem is NP-hard
- Right angle crossing graphs and 1-planarity
- Drawing Cubic Graphs with the Four Basic Slopes
- Combining problems on RAC drawings and simultaneous graph drawings
- Graphs that admit right angle crossing drawings
- 2-layer right angle crossing drawings
- Large angle crossing drawings of planar graphs in subquadratic area
- Circular graph drawings with large crossing angles
- Right Angle Crossing Drawings of Graphs
- Every outer-1-plane graph has a right angle crossing drawing
- On the perspectives opened by right angle crossing drawings
- Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles
- On the perspectives opened by right angle crossing drawings
- scientific article; zbMATH DE number 7759289 (Why is no real title available?)
- Crossing edge minimization in radial outerplanar layered graphs using segment paths
- Area, curve complexity, and crossing resolution of non-planar graph drawings
- Drawing graphs with right angle crossings
- Bounds on the crossing resolution of complete geometric graphs
- A characterization of complete bipartite RAC graphs
This page was built for publication: Drawing Graphs with Right Angle Crossings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183456)