Drawing graphs with vertices and edges in convex position

DOI10.1016/J.COMGEO.2016.06.002MaRDI QIDQ340526zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Drawing graphs with vertices and edges in convex position
• The convex dimension of a graph
• On geometric graphs with no two edges in convex position
• Bounds for Convex Crossing Numbers
• scientific article; zbMATH DE number 54803

Cites work

• A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets
• Convex combinatorial optimization
• Convexly independent subsets of the Minkowski sum of planar point sets
• Drawing graphs with vertices and edges in convex position
• Large convexly independent subsets of Minkowski sums
• On the largest convex subsets in Minkowski sums
• The convex dimension of a graph

Cited in

(6)

• Convexly independent subsets of Minkowski sums of convex polygons
• The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores theorem
• Drawing graphs with vertices and edges in convex position
• 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)