How to draw a planarization
From MaRDI portal
Recommendations
Cites work
- A fast straight-skeleton algorithm based on generalized motorcycle 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 planar graphs using the canonical ordering
- Drawing simultaneously embedded graphs with few bends
- Fáry's theorem for 1-planar graphs
- How to Draw a Graph
- scientific article; zbMATH DE number 4092241 (Why is no real title available?)
- scientific article; zbMATH DE number 2013741 (Why is no real title available?)
- 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
- 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
(6)
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 Q2971142)