Drawing plane graphs nicely

DOI10.1007/BF00264230zbMath0545.68057MaRDI QIDQ797289

Takao Nishizeki, Kazunori Onoguchi, Norishige Chiba

Publication date: 1985

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

convex polygonsefficient algorithmsdrawing plane graphsstraight line segments without crossing lines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (25)

A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs ⋮ Solides non organisés : définition, implantation et plongement ⋮ Combinatorial configurations, quasiline arrangements, and systems of curves on surfaces ⋮ Minimum-segment convex drawings of 3-connected cubic plane graphs ⋮ How to draw a hypergraph ⋮ Convex grid drawings of planar graphs with constant edge-vertex resolution ⋮ Algorithms for plane representations of acyclic digraphs ⋮ Parametrization and smooth approximation of surface triangulations ⋮ Rectangular grid drawings of plane graphs ⋮ Straight-line drawings of 1-planar graphs ⋮ An annotated review on graph drawing and its applications ⋮ On-line convex planarity testing ⋮ Connectivity of plane triangulations ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ A linear-time algorithm for drawing a planar graph on a grid ⋮ Area requirement and symmetry display of planar upward drawings ⋮ Rectangular grid drawings of plane graphs ⋮ An experimental comparison of four graph drawing algorithms. ⋮ Convex grid drawings of planar graphs with constant edge-vertex resolution ⋮ Convexity-increasing morphs of planar graphs ⋮ Polyline drawings with topological constraints ⋮ Minimum-width grid drawings of plane graphs ⋮ Polyline Drawings with Topological Constraints ⋮ Incremental convex planarity testing ⋮ Monotone drawings of graphs with fixed embedding

Cites Work

• Unnamed Item
• Unnamed Item
• A linear algorithm for embedding planar graphs using PQ-trees
• Planarity and duality of finite and infinite graphs
• The complexity of drawing trees nicely
• Convex Representations of Graphs
• Pretty-printing of trees
• Generalized Nested Dissection
• Efficient Planarity Testing
• Tidy Drawings of Trees
• Dividing a Graph into Triconnected Components
• How to Draw a Graph

This page was built for publication: Drawing plane graphs nicely