Star-Shaped and L-Shaped Orthogonal Drawings

DOI10.7155/jgaa.00409zbMath1358.05196OpenAlexW2579460967MaRDI QIDQ2971389

Dayu He, Xin He

Publication date: 5 April 2017

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

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

zbMATH Keywords

\(L\)-shaped polygonstar-shaped orthogonal drawing

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints
• On covering orthogonal polygons with star-shaped polygons
• Floorplanning by graph dualization: \(L\)-shaped modules
• Note on covering monotone orthogonal polygons with star-shaped polygons
• A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners
• On Orthogonally Convex Drawings of Plane Graphs
• Rectangular duals of planar graphs
• Finding a Minimum Circuit in a Graph
• On Floor-Plan of Plane Graphs
• On Finding the Rectangular Duals of Planar Triangular Graphs
• Orthogonal Drawings of Plane Graphs Without Bends
• ALL SEPARATING TRIANGLES IN A PLANE GRAPH CAN BE OPTIMALLY "BROKEN" IN POLYNOMIAL TIME

This page was built for publication: Star-Shaped and L-Shaped Orthogonal Drawings