A heuristic approach towards drawings of graphs with high crossing resolution
From MaRDI portal
Publication:1725757
DOI10.1007/978-3-030-04414-5_19OpenAlexW2889444332MaRDI QIDQ1725757
Publication date: 15 February 2019
Full work available at URL: https://arxiv.org/abs/1808.10519
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (4)
Unnamed Item ⋮ Graphs with large total angular resolution ⋮ Angular Resolutions: Around Vertices and Crossings ⋮ Graph Drawing via Gradient Descent, $$(GD)^2$$
Cites Work
- Unnamed Item
- Unnamed Item
- Recognizing and drawing IC-planar graphs
- Graphs that admit right angle crossing drawings
- 2-layer right angle crossing drawings
- Area, curve complexity, and crossing resolution of non-planar graph drawings
- Drawing graphs with right angle crossings
- A characterization of complete bipartite RAC graphs
- How to draw a planar graph on a grid
- Edge crossings in drawings of bipartite graphs
- Drawing planar graphs using the canonical ordering
- Right angle crossing graphs and 1-planarity
- On RAC drawings of 1-planar graphs
- \(\mathsf{NIC}\)-planar graphs
- Testing Full Outer-2-planarity in Linear Time
- Graphs That Admit Polyline Drawings with Few Crossing Angles
- Maximizing the Total Resolution of Graphs
- Topology-Driven Force-Directed Algorithms
- Drawing Graphs in the Plane with High Resolution
- The Straight-Line RAC Drawing Problem is NP-Hard
- An efficient graph planarization two‐phase heuristic
- Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area
- Notes on large angle crossing graphs
- On the Perspectives Opened by Right Angle Crossing Drawings
- Drawing graphs. Methods and models
This page was built for publication: A heuristic approach towards drawings of graphs with high crossing resolution
