How to Draw a Planarization
From MaRDI portal
Publication:5233140
DOI10.7155/jgaa.00506zbMath1419.05200OpenAlexW2972574109MaRDI QIDQ5233140
Ignaz Rutter, Thomas Bläsius, Marcel Radermacher
Publication date: 16 September 2019
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00506
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Extending convex partial drawings of graphs
- Corrections to Lee's visibility polygon algorithm
- A force-directed algorithm that preserves edge-crossing properties
- Inserting an edge into a planar graph
- Drawing planar graphs using the canonical ordering
- Drawing Simultaneously Embedded Graphs with Few Bends
- How to Draw a Planarization
- Topology-Driven Force-Directed Algorithms
- Straight-Line Drawability of a Planar Graph Plus an Edge
- The maximum number of halving lines and the rectilinear crossing number of for
- Complexity of Some Geometric and Topological Problems
- Topology Preserving Constrained Graph Layout
- Rectilinear drawings of graphs
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Plane-sweep algorithms for intersecting geometric figures
- Drawing planar graphs with many collinear vertices
- Aligned Drawings of Planar Graphs
- Polyline Drawings with Topological Constraints
- A Geometric Heuristic for Rectilinear Crossing Minimization
- A FAST STRAIGHT-SKELETON ALGORITHM BASED ON GENERALIZED MOTORCYCLE GRAPHS
- Motorcycle graphs
- How to Draw a Graph
- Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area
- Drawing Partially Embedded and Simultaneously Planar Graphs
- Inserting an edge into a geometric embedding
This page was built for publication: How to Draw a Planarization
