Drawing graphs with vertices and edges in convex position

DOI10.1016/j.comgeo.2016.06.002zbMath1350.05107OpenAlexW2473792791MaRDI QIDQ340526

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

zbMATH Keywords

Minkowski sumplanar point setsstrong convex dimension

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Convexly independent subsets of Minkowski sums of convex polygons ⋮ The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores theorem

Cites Work

• 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
• 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