Extending Partial Orthogonal Drawings

DOI10.7155/jgaa.00573zbMath1489.05135OpenAlexW3208123662MaRDI QIDQ5084696

T. P. Sandhya, Ignaz Rutter, Patrizio Angelini

Publication date: 28 June 2022

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

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) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Extending partial representations of proper and unit interval graphs
• Orthogonal graph drawing with inflexible edges
• Extending partial representations of trapezoid graphs
• A Kuratowski-type theorem for planarity of partially embedded graphs
• Extending partial representations of subclasses of chordal graphs
• Extending partial representations of interval graphs
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• Contact Representations of Planar Graphs: Extending a Partial Representation is Hard
• Simultaneous Orthogonal Planarity
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• The Problem of Compatible Representatives
• Spirality and Optimal Orthogonal Drawings
• Testing Planarity of Partially Embedded Graphs
• Optimal Orthogonal Graph Drawing with Convex Bend Costs
• Extending Partial Orthogonal Drawings
• Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
• Extending partial representations of circle graphs
• OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE
• ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWING
• Graph-Theoretic Solutions to Computational Geometry Problems
• Drawing Partially Embedded and Simultaneously Planar Graphs
• Embedding planar graphs at fixed vertex locations