How to draw a planarization

DOI10.7155/JGAA.00506MaRDI QIDQ5233140zbMATH OpenOpenAlexFDO

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)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00506

zbMATH Keywords

geometric planarization drawingplanarization

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(5)

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

Describes a project that uses

Uses Software

• Moca
• OGDF

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)