scientific article; zbMATH DE number 4006289

zbMATH Open0621.05014MaRDI QIDQ3757930FDOQ3757930

Ronald C. Read

Publication date: 1987

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

planar graphplanar triangulationstraight line drawing

Mathematics Subject Classification ID

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

Cited In (18)

• Graph theory and the amateur cryptographer
• A more compact visibility representation
• Optimal polygonal representation of planar graphs
• Grid embedding of 4-connected plane graphs
• Triangulating planar graphs while minimizing the maximum degree
• Establishing order in planar subdivisions
• A Simple Criterion for Nodal 3-connectivity in Planar Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Area requirement and symmetry display of planar upward drawings
• On triangulating planar graphs under the four-connectivity constraint
• Triangulating planar graphs while minimizing the maximum degree
• Drawing \(c\)-planar biconnected clustered graphs
• Topological sweep of the complete graph
• An experimental comparison of four graph drawing algorithms.
• Adjacency graphs of polyhedral surfaces
• Does contraction preserve triangular meshes?
• Constructing compact rectilinear planar layouts using canonical representation of planar 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)