Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints
DOI10.1007/978-3-540-69733-6_40zbMATH Open1148.68549OpenAlexW1538773276MaRDI QIDQ3511352FDOQ3511352
Authors: Seok-Hee Hong, Hiroshi Nagamochi 
Publication date: 10 July 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_40
Recommendations
- Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints
- 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
- Convex drawings of graphs with non-convex boundary constraints
- Convex Drawings of Graphs with Non-convex Boundary
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (10)
- \(\beta\)-stars or on extending a drawing of a connected subgraph
- Non-convex Representations of Graphs
- Star-shaped and \(L\)-shaped orthogonal drawings
- Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints
- An algorithm for constructing star-shaped drawings of plane graphs
- Drawing slicing graphs with face areas
- Convex drawings of graphs with non-convex boundary constraints
- 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: Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511352)
