Graph Drawing
From MaRDI portal
Publication:5711638
DOI10.1007/b105810zbMath1111.68559OpenAlexW4206160220WikidataQ56267165 ScholiaQ56267165MaRDI QIDQ5711638
Nicolas Bonichon, Mohamed Mosbah, Stefan Felsner
Publication date: 7 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b105810
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
Monotone Drawings of 3-Connected Plane Graphs ⋮ On simultaneous straight-line grid embedding of a planar graph and its dual ⋮ On the Number of α-Orientations ⋮ 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 ⋮ Convex drawings of graphs with non-convex boundary constraints ⋮ A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs ⋮ An algorithm for constructing star-shaped drawings of plane graphs
This page was built for publication: Graph Drawing
