A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets

zbMath1205.52010MaRDI QIDQ612909

Ondřej Bílka, Masashi Kiyomi, Kevin Buchin, Yoshio Okamoto, Csaba D. Tóth, Radoslav Fulek, Shin-ichi Tanigawa

Publication date: 16 December 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/228690

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Erd?s problems and related topics of discrete geometry (52C10) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (4)

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 ⋮ A \(\tau \)-conjecture for Newton polygons

This page was built for publication: A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets