Drawing graphs with vertices and edges in convex position
From MaRDI portal
Publication:340526
DOI10.1016/J.COMGEO.2016.06.002zbMATH Open1350.05107OpenAlexW2473792791MaRDI QIDQ340526FDOQ340526
Authors: Ignacio García Marco, Kolja Knauer
Publication date: 14 November 2016
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2016.06.002
Recommendations
Combinatorial aspects of finite geometries (05B25) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Convexly independent subsets of the Minkowski sum of planar point sets
- Convex combinatorial optimization
- On the largest convex subsets in Minkowski sums
- Drawing Graphs with Vertices and Edges in Convex Position
- A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets
- Large convexly independent subsets of Minkowski sums
- The convex dimension of a graph
Cited In (5)
- Convexly independent subsets of Minkowski sums of convex polygons
- The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores theorem
- The convex dimension of a graph
- Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles
- Graph drawing with morphing partial edges
This page was built for publication: Drawing graphs with vertices and edges in convex position
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340526)