On the largest convex subsets in Minkowski sums
From MaRDI portal
Publication:2448109
DOI10.1016/j.ipl.2014.02.013zbMath1296.68105MaRDI QIDQ2448109
Publication date: 30 April 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2014.02.013
68R05: Combinatorics in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
52A40: Inequalities and extremum problems involving convexity in convex geometry
Related Items
Drawing graphs with vertices and edges in convex position, Convexly independent subsets of Minkowski sums of convex polygons, The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores theorem
Cites Work