Constrained visibility representations of graphs

DOI10.1016/0020-0190(92)90072-4zbMath0742.68078OpenAlexW2024208603MaRDI QIDQ1186563

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

Publication date: 28 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90072-4

zbMATH Keywords

planaritydisjoint pathsvisibility representationsautomatic graph drawingcritical pathsPERT diagrams

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Planar straight-line realizations of 2-trees with prescribed edge lengths, Special graph representation and visualization of semantic networks, A more compact visibility representation, DRAWING DIRECTED ACYCLIC GRAPHS: AN EXPERIMENTAL STUDY, Width-Optimal Visibility Representations of Plane Graphs, Computing Upward Topological Book Embeddings of Upward Planar Digraphs, Unnamed Item, Computing upward topological book embeddings of upward planar digraphs, Advances in the theory and practice of graph drawing

Cites Work

• A unified approach to visibility representations of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Algorithms for plane representations of acyclic digraphs
• Representations of Graphs on a Cylinder