An algorithm for constructing star-shaped drawings of plane graphs
From MaRDI portal
Publication:1037784
DOI10.1016/J.COMGEO.2009.06.008zbMATH Open1219.05101OpenAlexW2047410653MaRDI QIDQ1037784FDOQ1037784
Authors: Seok-Hee Hong, Hiroshi Nagamochi 
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
Recommendations
- A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners
- Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints
- scientific article; zbMATH DE number 68923
- Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints
- An algorithm for straight-line drawing of planar graphs
- Representing triangulated graphs in stars
- On the planarity of iterated star-line graphs
- An algorithm for drawing general undirected graphs
- Algorithms for Drawing Planar p-petal Graphs
- A linear-time algorithm for drawing a planar graph on a grid
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On-Line Planarity Testing
- Drawing graphs. Methods and models
- Dividing a Graph into Triconnected Components
- Title not available (Why is that?)
- Convex drawings of graphs with non-convex boundary constraints
- Bemerkungen zum Vierfarbenproblem
- Convex Maps
- Convex drawings of hierarchical planar graphs and clustered planar graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convex Representations of Graphs
- Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints
- CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS
- CONVEX DRAWINGS OF PLANE GRAPHS OF MINIMUM OUTER APICES
- Graph Drawing
- Convex Drawings of Graphs with Non-convex Boundary
Cited In (12)
- Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints
- Star-shaped and \(L\)-shaped orthogonal drawings
- Title not available (Why is that?)
- Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints
- Convex Drawings of Graphs with Non-convex Boundary
- Algorithms for 1-Planar Graphs
- Title not available (Why is that?)
- Convex drawings of graphs with non-convex boundary constraints
- Simultaneous embeddings with few bends and crossings
- Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra
- A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners
- Star shaped orthogonal drawing
This page was built for publication: An algorithm for constructing star-shaped drawings of plane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1037784)
