An algorithm for constructing star-shaped drawings of plane graphs

DOI10.1016/j.comgeo.2009.06.008zbMath1219.05101OpenAlexW2047410653MaRDI QIDQ1037784

Hiroshi Nagamochi, Seok-Hee Hong

Publication date: 16 November 2009

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2009.06.008

zbMATH Keywords

graph drawingconvex drawingplane graphsbiconnected plane graphsconcave cornerstar-shaped drawing

Mathematics Subject Classification ID

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

Related Items

A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners, Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints, Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra, Simultaneous Embeddings with Few Bends and Crossings, Algorithms for 1-Planar Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convex drawings of graphs with non-convex boundary constraints
• Convex drawings of hierarchical planar graphs and clustered planar graphs
• Bemerkungen zum Vierfarbenproblem
• Convex Representations of Graphs
• Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints
• Convex Drawings of Graphs with Non-convex Boundary
• On-Line Planarity Testing
• Dividing a Graph into Triconnected Components
• CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS
• CONVEX DRAWINGS OF PLANE GRAPHS OF MINIMUM OUTER APICES
• Graph Drawing
• Convex Maps
• Drawing graphs. Methods and models