Area requirement and symmetry display of planar upward drawings

DOI10.1007/BF02187850zbMath0757.05055OpenAlexW1971813586MaRDI QIDQ1189288

Giuseppe Di Battista, Roberto Tamassia, Ioannis. G. Tollis

Publication date: 26 September 1992

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131203

zbMATH Keywords

linear-time algorithmplanar drawingplanar acyclic digraphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items

Area requirement of visibility representations of trees ⋮ Proximity drawings in polynomial area and volume ⋮ Succinct greedy drawings do not always exist ⋮ Straight-Line Drawability of a Planar Graph Plus an Edge ⋮ A linear algorithm to decompose inheritance graphs into modules ⋮ How to draw a series-parallel digraph ⋮ Upward Straight-Line Embeddings of Directed Graphs into Point Sets ⋮ The strength of weak proximity ⋮ Upward planarity testing ⋮ Upward planar drawings with two slopes ⋮ Drawing planar graphs using the canonical ordering ⋮ New results on drawing angle graphs ⋮ Upward planar drawings on the standing and the rolling cylinders ⋮ Overloaded Orthogonal Drawings ⋮ Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario ⋮ A Sublinear Bound on the Page Number of Upward Planar Graphs ⋮ How to draw a planar clustered graph ⋮ Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ \(st\)-orientations with few transitive edges ⋮ $st$-Orientations with Few Transitive Edges ⋮ A more compact visibility representation ⋮ On the enumeration of plane bipolar posets and transversal structures ⋮ Bitonic st-orderings for Upward Planar Graphs ⋮ Dominance drawings for DAGs with bounded modular width ⋮ ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS ⋮ 4-connected triangulations on few lines ⋮ DRAWING DIRECTED ACYCLIC GRAPHS: AN EXPERIMENTAL STUDY ⋮ A force-directed algorithm for drawing directed graphs symmetrically ⋮ Extending upward planar graph drawings ⋮ Maximum upward planar subgraphs of embedded planar digraphs ⋮ Three-dimensional graph drawing ⋮ Unnamed Item ⋮ Monotone drawings of graphs with few directions ⋮ Upward drawings of triconnected digraphs. ⋮ Baxter permutations and plane bipolar orientations ⋮ Upward planar morphs ⋮ The partial visibility representation extension problem ⋮ Upward planar morphs ⋮ Volume requirements of 3D upward drawings ⋮ Transversal structures on triangulations: A combinatorial study and straight-line drawings ⋮ Minimum-width grid drawings of plane graphs ⋮ Upward Book Embeddings of st-Graphs ⋮ Advances in the theory and practice of graph drawing ⋮ Upward straight-line embeddings of directed graphs into point sets ⋮ Spring algorithms and symmetry ⋮ How to draw a clustered tree ⋮ Right Angle Crossing Drawings of Graphs ⋮ Bipolar orientations revisited ⋮ Characterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posets ⋮ Characterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability Graphs ⋮ Towards area requirements for drawing hierarchically planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Drawing plane graphs nicely
• How to draw a planar graph on a grid
• Dynamic maintenance of planar digraphs, with applications
• Bipartite graphs, upward drawings, and planarity
• A linear algorithm for embedding planar graphs using PQ-trees
• A unified approach to visibility representations of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Fundamentals of planar ordered sets
• Representing orders on the plane by translating convex figures
• Algorithms for plane representations of acyclic digraphs
• The complexity of drawing trees nicely
• Fast detection and display of symmetry in outerplanar graphs
• On the vector representation of the reachability in planar directed graphs
• Planar lattices and planar graphs
• Algorithms for drawing graphs: An annotated bibliography
• Planar acyclic oriented graphs
• On minimal-node-cost planar embeddings
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• A Depth-First-Search Characterization of Planarity
• Efficient Planarity Testing
• Planar Lattices
• How to Draw a Graph
• Convex Maps