An algorithm for constructing star-shaped drawings of plane graphs
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 2123122 (Why is no real title available?)
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 3882430 (Why is no real title available?)
- scientific article; zbMATH DE number 3882450 (Why is no real title available?)
- scientific article; zbMATH DE number 3885930 (Why is no real title available?)
- scientific article; zbMATH DE number 2080088 (Why is no real title available?)
- scientific article; zbMATH DE number 3047038 (Why is no real title available?)
- Bemerkungen zum Vierfarbenproblem
- CONVEX DRAWINGS OF PLANE GRAPHS OF MINIMUM OUTER APICES
- CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS
- Convex Drawings of Graphs with Non-convex Boundary
- Convex Maps
- Convex Representations of Graphs
- Convex drawings of graphs with non-convex boundary constraints
- Convex drawings of hierarchical planar graphs and clustered planar graphs
- Dividing a Graph into Triconnected Components
- Drawing graphs. Methods and models
- Graph Drawing
- On-Line Planarity Testing
- Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints
Cited in
(12)- scientific article; zbMATH DE number 841998 (Why is no real title available?)
- Simultaneous embeddings with few bends and crossings
- Algorithms for 1-Planar Graphs
- Convex drawings of graphs with non-convex boundary constraints
- Star shaped orthogonal drawing
- Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints
- A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners
- scientific article; zbMATH DE number 3885930 (Why is no real title available?)
- Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints
- Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra
- Convex Drawings of Graphs with Non-convex Boundary
- Star-shaped and \(L\)-shaped orthogonal drawings
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)