Convexly independent subsets of the Minkowski sum of planar point sets
From MaRDI portal
Publication:1010661
zbMath1160.52013MaRDI QIDQ1010661
János Pach, Nir B. Sopher, Thomas Rothvoß, Friedrich Eisenbrand
Publication date: 7 April 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/129863
Erd?s problems and related topics of discrete geometry (52C10) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items
Drawing graphs with vertices and edges in convex position, Log-Concavity and Lower Bounds for Arithmetic Circuits, On the largest convex subsets in Minkowski sums, Convexly independent subsets of Minkowski sums of convex polygons, The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores theorem, Constrained Minkowski sums: A geometric framework for solving interval problems in computational biology efficiently, A \(\tau \)-conjecture for Newton polygons
