Area requirement and symmetry display of planar upward drawings
From MaRDI portal
Publication:1189288
DOI10.1007/BF02187850zbMATH Open0757.05055OpenAlexW1971813586MaRDI QIDQ1189288FDOQ1189288
Authors: 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
Recommendations
- On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs
- ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS
- scientific article; zbMATH DE number 4062623
- scientific article; zbMATH DE number 68923
- PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA
Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- A linear algorithm for embedding planar graphs using PQ-trees
- Efficient Planarity Testing
- Title not available (Why is that?)
- How to draw a planar graph on a grid
- A unified approach to visibility representations of planar graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Algorithms for drawing graphs: An annotated bibliography
- Title not available (Why is that?)
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- How to Draw a Graph
- Planar Lattices
- Title not available (Why is that?)
- Bipartite graphs, upward drawings, and planarity
- Algorithms for plane representations of acyclic digraphs
- Title not available (Why is that?)
- Fundamentals of planar ordered sets
- On minimal-node-cost planar embeddings
- Convex Maps
- Title not available (Why is that?)
- Dynamic maintenance of planar digraphs, with applications
- Planar lattices and planar graphs
- A Depth-First-Search Characterization of Planarity
- Representing orders on the plane by translating convex figures
- Title not available (Why is that?)
- Drawing plane graphs nicely
- On the vector representation of the reachability in planar directed graphs
- The complexity of drawing trees nicely
- Title not available (Why is that?)
- Title not available (Why is that?)
- Planar acyclic oriented graphs
- Title not available (Why is that?)
- Fast detection and display of symmetry in outerplanar graphs
Cited In (52)
- On upward-planar L-drawings of graphs
- A fixed-parameter algorithm for dominance drawings of DAGs
- Towards area requirements for drawing hierarchically planar graphs
- A more compact visibility representation
- Right Angle Crossing Drawings of Graphs
- On the enumeration of plane bipolar posets and transversal structures
- Upward drawings of triconnected digraphs.
- Upward straight-line embeddings of directed graphs into point sets
- Upward planar morphs
- Succinct greedy drawings do not always exist
- Three-dimensional graph drawing
- Upward planar morphs
- Minimum-width grid drawings of plane graphs
- Proximity drawings in polynomial area and volume
- \(st\)-orientations with few transitive edges
- $st$-Orientations with Few Transitive Edges
- Bitonic \(st\)-orderings for upward planar graphs
- Area requirement of visibility representations of trees
- Title not available (Why is that?)
- New results on drawing angle graphs
- How to draw a series-parallel digraph
- Dominance drawings for DAGs with bounded modular width
- 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
- Overloaded orthogonal drawings
- ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS
- Straight-Line Drawability of a Planar Graph Plus an Edge
- Title not available (Why is that?)
- Upward book embeddings of st-graphs
- Volume requirements of 3D upward drawings
- Upward book embeddability of \(st\)-graphs: complexity and algorithms
- Characterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability Graphs
- Maximum upward planar subgraphs of embedded planar digraphs
- Baxter permutations and plane bipolar orientations
- 4-connected triangulations on few lines
- Transversal structures on triangulations: A combinatorial study and straight-line drawings
- Advances in the theory and practice of graph drawing
- Upward planarity testing
- Spring algorithms and symmetry
- Upward planar drawings with two slopes
- Drawing directed acyclic graphs: an experimental study
- Drawing planar graphs using the canonical ordering
- How to draw a planar clustered graph
- How to draw a clustered tree
- A linear algorithm to decompose inheritance graphs into modules
- Monotone drawings of graphs with few directions
- The strength of weak proximity
- Bipolar orientations revisited
- Characterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posets
- Upward Straight-Line Embeddings of Directed Graphs into Point Sets
- A force-directed algorithm for drawing directed graphs symmetrically
- Upward planar drawings on the standing and the rolling cylinders
This page was built for publication: Area requirement and symmetry display of planar upward drawings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1189288)
