Drawing plane graphs nicely
This paper presents two efficient algorithms for drawing plane graphs nicely. Both draw all edges of a graph as straight line segments without crossing lines. The first draws a plane graph convex if possible, that is, in a way that every inner face and the complement of the outer face are convex polygons. The second, using the first, procedures a pleasing of a given plane graph that satisfies the following property as far as possible: the complements of 3-connected components, together with inner faces and the complement of the outer face, are convex polygons. The running time and storage space of both algorithms are linear in the number of vertices of the graph.
- 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
- scientific article; zbMATH DE number 3885930 (Why is no real title available?)
- scientific article; zbMATH DE number 3047038 (Why is no real title available?)
- Planarity and duality of finite and infinite graphs
- Pretty-printing of trees
- The complexity of drawing trees nicely
- Tidy Drawings of Trees
- Algorithms for plane representations of acyclic digraphs
- Representations of graphs and networks (coding, layouts and embeddings)
- Area requirement and symmetry display of planar upward drawings
- Minimum-width grid drawings of plane graphs
- An algorithm for straight-line drawing of planar graphs
- Parametrization and smooth approximation of surface triangulations
- Rectangular grid drawings of plane graphs
- Incremental convex planarity testing
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- Polyline drawings with topological constraints
- Monotone drawings of graphs with fixed embedding
- Minimum-segment convex drawings of 3-connected cubic plane graphs
- An experimental comparison of four graph drawing algorithms.
- scientific article; zbMATH DE number 1693555 (Why is no real title available?)
- Drawing Graphs on Few Lines and Few Planes
- Drawing Graphs in the Plane with High Resolution
- Combinatorial configurations, quasiline arrangements, and systems of curves on surfaces
- scientific article; zbMATH DE number 3885930 (Why is no real title available?)
- How to draw a hypergraph
- scientific article; zbMATH DE number 4006289 (Why is no real title available?)
- Solides non organisés : définition, implantation et plongement
- Polyline Drawings with Topological Constraints
- Algorithms and Computation
- scientific article; zbMATH DE number 975400 (Why is no real title available?)
- scientific article; zbMATH DE number 2188498 (Why is no real title available?)
- Convexity-increasing morphs of planar graphs
- Straight-line drawings of 1-planar graphs
- Rectangular grid drawings of plane graphs
- An annotated review on graph drawing and its applications
- On-line convex planarity testing
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- A linear-time algorithm for drawing a planar graph on a grid
- A finite algorithm for the realizabilty of a Delaunay triangulation
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
- Connectivity of plane triangulations
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)
