Area-efficient static and incremental graph drawings

DOI10.1007/3-540-63397-9_4MaRDI QIDQ826069zbMATH OpenOpenAlexFDO

Authors Michael Kaufmann, Therese Biedl

Publication date 20 December 2021

Full work available at URL https://doi.org/10.1007/3-540-63397-9_4

zbMATH Keywords

planar graphfree edgeincoming edgeoutgoing edgestatic scenario

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Algorithms for area-efficient orthogonal drawing
• Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions
• Drawing planar graphs using the canonical ordering
• scientific article; zbMATH DE number 1974134
• A better heuristic for orthogonal graph drawings

Cited in

(23)

• scientific article; zbMATH DE number 1974134 (Why is no real title available?)
• On minimum- and maximum-weight minimum spanning trees with neighborhoods
• Fan-crossing free graphs and their relationship to other beyond-planar graphs
• Graph compact orthogonal layout algorithm
• Streamed Graph Drawing and the File Maintenance Problem
• Algorithms and bounds for L-drawings of directed graphs
• scientific article; zbMATH DE number 2084280 (Why is no real title available?)
• Orthogonal drawings based on the stratification of planar graphs
• Bounded degree acyclic decompositions of digraphs.
• Square-orthogonal drawing with few bends per edge
• Drawing trees in a streaming model
• Relating bends and size in orthogonal graph drawings
• Bend-optimal orthogonal graph drawing in the general position model
• Drawing Clustered Graphs on an Orthogonal Grid
• GRIP: Graph Drawing with Intelligent Placement
• An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing
• Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs
• Non-planar square-orthogonal drawing with few-bend edges
• The DFS-heuristic for orthogonal graph drawing
• Optimal-area visibility representations of outer-1-plane graphs
• On the complexity of some geometric problems with fixed parameters
• Balanced vertex-orderings of graphs
• SOFSEM 2005: Theory and Practice of Computer Science

This page was built for publication: Area-efficient static and incremental graph drawings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q826069)