Convex Drawings of Graphs with Non-convex Boundary
From MaRDI portal
Publication:3522948
DOI10.1007/11917496_11zbMath1167.68456OpenAlexW2159752644MaRDI QIDQ3522948
Hiroshi Nagamochi, Seok-Hee Hong
Publication date: 4 September 2008
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11917496_11
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (4)
A Polynomial Bound for Untangling Geometric Planar Graphs ⋮ Embedding a triangular graph within a given boundary ⋮ Non-convex Representations of Graphs ⋮ An algorithm for constructing star-shaped drawings of plane graphs
This page was built for publication: Convex Drawings of Graphs with Non-convex Boundary
