Recommendations
Cites work
- scientific article; zbMATH DE number 3885930 (Why is no real title available?)
- scientific article; zbMATH DE number 3047038 (Why is no real title available?)
- A linear algorithm for embedding planar graphs using PQ-trees
- Convex Representations of Graphs
- Dividing a Graph into Triconnected Components
- Efficient Planarity Testing
- Generalized Nested Dissection
- How to Draw a Graph
- Planarity and duality of finite and infinite graphs
- Pretty-printing of trees
- The complexity of drawing trees nicely
- Tidy Drawings of Trees
Cited in
(32)- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
- Algorithms and Computation
- Minimum-width grid drawings of plane graphs
- An annotated review on graph drawing and its applications
- Combinatorial configurations, quasiline arrangements, and systems of curves on surfaces
- Convexity-increasing morphs of planar graphs
- Rectangular grid drawings of plane graphs
- Polyline Drawings with Topological Constraints
- Monotone drawings of graphs with fixed embedding
- scientific article; zbMATH DE number 3885930 (Why is no real title available?)
- Straight-line drawings of 1-planar graphs
- scientific article; zbMATH DE number 1693555 (Why is no real title available?)
- Rectangular grid drawings of plane graphs
- Parametrization and smooth approximation of surface triangulations
- A linear-time algorithm for drawing a planar graph on a grid
- Minimum-segment convex drawings of 3-connected cubic plane graphs
- Area requirement and symmetry display of planar upward drawings
- On-line convex planarity testing
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- Drawing Graphs on Few Lines and Few Planes
- Drawing Graphs in the Plane with High Resolution
- Polyline drawings with topological constraints
- Algorithms for plane representations of acyclic digraphs
- An experimental comparison of four graph drawing algorithms.
- Connectivity of plane triangulations
- Solides non organisés : définition, implantation et plongement
- Incremental convex planarity testing
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- How to draw a hypergraph
- scientific article; zbMATH DE number 4006289 (Why is no real title available?)
- scientific article; zbMATH DE number 2188498 (Why is no real title available?)
- Representations of graphs and networks (coding, layouts and embeddings)
This page was built for publication: Drawing plane graphs nicely
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797289)
