How to draw a planarization

DOI10.7155/JGAA.00506zbMATH Open1419.05200OpenAlexW2972574109MaRDI QIDQ5233140FDOQ5233140

Authors: Thomas Bläsius, Marcel Radermacher, Ignaz Rutter 

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

Recommendations

• How to draw a planarization
• Advances in the planarization method: effective multiple edge insertions
• Advances in the planarization method: effective multiple edge insertions
• Mathematical programs for drawing nonplanar graphs in the plane
• Drawing non-planar graphs with crossing-free subgraphs

zbMATH Keywords

planarizationgeometric planarization drawing

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Rectilinear drawings of graphs
• Title not available (Why is that?)
• Topology-driven force-directed algorithms
• Drawing planar graphs using the canonical ordering
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• How to Draw a Graph
• Complexity of some geometric and topological problems
• Plane-sweep algorithms for intersecting geometric figures
• Extending convex partial drawings of graphs
• Drawing graphs in the plane with a prescribed outer face and polynomial area
• A fast straight-skeleton algorithm based on generalized motorcycle graphs
• Corrections to Lee's visibility polygon algorithm
• The maximum number of halving lines and the rectilinear crossing number of for
• Aligned drawings of planar graphs
• Motorcycle graphs, stochastic properties motivate an efficient yet simple implementation
• Handbook of parametric and nonparametric statistical procedures
• Inserting an edge into a planar graph
• Topology Preserving Constrained Graph Layout
• A force-directed algorithm that preserves edge-crossing properties
• Straight-Line Drawability of a Planar Graph Plus an Edge
• A Geometric Heuristic for Rectilinear Crossing Minimization
• Drawing partially embedded and simultaneously planar graphs
• Drawing planar graphs with many collinear vertices
• Drawing simultaneously embedded graphs with few bends
• How to draw a planarization
• Polyline Drawings with Topological Constraints
• Inserting an edge into a geometric embedding

Cited In (3)

• Mathematical programs for drawing nonplanar graphs in the plane
• How to draw a planarization
• Drawing non-planar graphs with crossing-free subgraphs

Uses Software

• OGDF
• Moca

This page was built for publication: How to draw a planarization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233140)