scientific article; zbMATH DE number 4006289

zbMATH Open0621.05014MaRDI QIDQ3757930FDOQ3757930

Authors Ronald C. Read

Publication date 1987

zbMATH Keywords

planar graphplanar triangulationstraight line drawing

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• An algorithm for straight-line drawing of planar graphs
• scientific article; zbMATH DE number 1990911
• A linear-time algorithm for drawing a planar graph on an \((n-2)\times (n-2)\) grid.
• A linear-time algorithm for drawing a planar graph on a grid
• Drawing plane graphs nicely

Cited in

(20)

• Triangulating planar graphs while minimizing the maximum degree
• Triangulating planar graphs while minimizing the maximum degree
• Graph theory and the amateur cryptographer
• A simple criterion for nodal 3-connectivity in planar graphs
• Does contraction preserve triangular meshes?
• Area requirement and symmetry display of planar upward drawings
• scientific article; zbMATH DE number 2187701 (Why is no real title available?)
• Topological sweep of the complete graph
• An experimental comparison of four graph drawing algorithms.
• A more compact visibility representation
• Adjacency graphs of polyhedral surfaces
• Grid embedding of 4-connected plane graphs
• Establishing order in planar subdivisions
• Rotation systems and simple drawings in surfaces
• Constructing compact rectilinear planar layouts using canonical representation of planar graphs
• On triangulating planar graphs under the four-connectivity constraint
• Construction of a topological drawing of the most planar subgraph of the non-planar graph
• Planarity testing and constructing the topological drawing of a plane graph (DFS)
• scientific article; zbMATH DE number 1693555 (Why is no real title available?)
• Drawing \(c\)-planar biconnected clustered graphs

This page was built for publication:

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