Drawing plane graphs nicely
From MaRDI portal
Publication:797289
DOI10.1007/BF00264230zbMATH Open0545.68057MaRDI QIDQ797289FDOQ797289
Authors: Norishige Chiba, Kazunori Onoguchi, Takao Nishizeki 
Publication date: 1985
Published in: Acta Informatica (Search for Journal in Brave)
Recommendations
convex polygonsefficient algorithmsdrawing plane graphsstraight line segments without crossing lines
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)
Cites Work
- Generalized Nested Dissection
- A linear algorithm for embedding planar graphs using PQ-trees
- Planarity and duality of finite and infinite graphs
- Efficient Planarity Testing
- Title not available (Why is that?)
- Pretty-printing of trees
- Tidy Drawings of Trees
- Dividing a Graph into Triconnected Components
- How to Draw a Graph
- Title not available (Why is that?)
- Convex Representations of Graphs
- The complexity of drawing trees nicely
Cited In (32)
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
- Algorithms and Computation
- 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
- Minimum-width grid drawings of plane graphs
- Rectangular grid drawings of plane graphs
- Polyline Drawings with Topological Constraints
- Monotone drawings of graphs with fixed embedding
- Title not available (Why is that?)
- Straight-line drawings of 1-planar graphs
- Title not available (Why is that?)
- 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
- On-line convex planarity testing
- Area requirement and symmetry display of planar upward drawings
- 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
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- An experimental comparison of four graph drawing algorithms.
- Algorithms for plane representations of acyclic digraphs
- Connectivity of plane triangulations
- Incremental convex planarity testing
- Solides non organisés : définition, implantation et plongement
- How to draw a hypergraph
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)
