Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints

DOI10.1007/978-3-540-69733-6_40zbMath1148.68549OpenAlexW1538773276MaRDI QIDQ3511352

Hiroshi Nagamochi, Seok-Hee Hong

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

Mathematics Subject Classification ID

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)

Related Items (6)

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 ⋮ Non-convex Representations of Graphs ⋮ Drawing slicing graphs with face areas ⋮ An algorithm for constructing star-shaped drawings of plane graphs

This page was built for publication: Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints