Extending partial orthogonal drawings

DOI10.7155/JGAA.00573MaRDI QIDQ5084696zbMATH OpenOpenAlexFDO

Authors Patrizio Angelini, Ignaz Rutter, T. P. Sandhya

Publication date 28 June 2022

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00573

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Graph Drawing
• ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWING
• Testing planarity of partially embedded graphs
• Extending convex partial drawings of graphs

Cites work

• A Kuratowski-type theorem for planarity of partially embedded graphs
• Contact representations of planar graphs: extending a partial representation is hard
• Drawing partially embedded and simultaneously planar graphs
• Embedding planar graphs at fixed vertex locations
• Extending Partial Orthogonal Drawings
• Extending partial representations of circle graphs
• Extending partial representations of subclasses of chordal graphs
• Extending partial representations of trapezoid graphs
• Graph-Theoretic Solutions to Computational Geometry Problems
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWING
• On the computational complexity of upward and rectilinear planarity testing
• Optimal binary space partitions for segments in the plane
• Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
• Optimal orthogonal graph drawing with convex bend costs
• Orthogonal graph drawing with inflexible edges
• Simultaneous orthogonal planarity
• Spirality and Optimal Orthogonal Drawings
• Testing Planarity of Partially Embedded Graphs
• The Problem of Compatible Representatives

Cited in

(8)

• -stars or on extending a drawing of a connected subgraph
• Optimally extending bistandard graphs on the orthogonal grid (extended abstract)
• 1-bend orthogonal partial edge drawing
• Graph Drawing
• Extending orthogonal planar graph drawings is fixed-parameter tractable
• The parameterized complexity of extending stack layouts
• The parameterized complexity of extending stack layouts
• Structural parameterizations of simultaneous planarity

This page was built for publication: Extending partial orthogonal drawings

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