Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints
From MaRDI portal
Publication:442281
DOI10.1016/j.tcs.2012.05.011zbMath1246.05109OpenAlexW2036097107MaRDI QIDQ442281
Hiroshi Nagamochi, Seok-Hee Hong
Publication date: 10 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.05.011
graph drawingconvex drawingplane graphsstar-shaped polygonbiconnected plane graphsconcave cornerstar-shaped drawing
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Cites Work
- 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
- An algorithm for constructing star-shaped drawings of plane graphs
- A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners
- Bemerkungen zum Vierfarbenproblem
- Convex Representations of Graphs
- Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints
- 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