Empty convex polygons in almost convex sets

zbMATH Open1157.52306MaRDI QIDQ950297FDOQ950297

Authors: Pavel Valtr, Gyula Károlyi, Gabor Lippner 

Publication date: 22 October 2008

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Recommendations

• Almost empty polygons
• A sufficient condition for the existence of large empty convex polygons
• Drawing the almost convex set in an integer grid of minimum size
• Large empty convex polygons in \(k\)-convex sets
• Planar sets with few empty convex polygons

zbMATH Keywords

empty polygonscombinatorial convexitypoint configurationsErdös-Szekeres problem

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Cited In (9)

• Title not available (Why is that?)
• Constructions from empty polygons
• A simple proof for open cups and caps
• On empty convex polytopes
• Extremal properties for triangulation based on empty convex set condition
• Drawing the almost convex set in an integer grid of minimum size
• Empty convex hexagons in planar point sets
• Every large point set contains many collinear points or an empty pentagon
• Holes in 2-convex point sets

This page was built for publication: Empty convex polygons in almost convex sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q950297)