On \(k\)-convex point sets

DOI10.1016/j.comgeo.2014.04.004zbMath1292.52001OpenAlexW2096595186MaRDI QIDQ2248736

Thomas Hackl, Pedro A. Ramos, Birgit Vogtenhuber, Jorge Urrutia, Alexander Pilz, Franz Aurenhammer, Pavel Valtr, Ferran Hurtado, Oswin Aichholzer

Publication date: 27 June 2014

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2014.04.004

zbMATH Keywords

Erdős-Szekeres problem\(k\)-convexitypolygonization2-convexity

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Erd?s problems and related topics of discrete geometry (52C10) Convex sets in (2) dimensions (including convex curves) (52A10) Combinatorial complexity of geometric structures (52C45)

Related Items (4)

The Mathematics of Ferran Hurtado: A Brief Survey ⋮ On \(k\)-convex polygons ⋮ Holes in 2-convex point sets ⋮ On Erdős-Szekeres-type problems for \(k\)-convex point sets

Cites Work

• On \(k\)-convex polygons
• Konvexe Fünfecke in ebenen Punktmengen
• A positive fraction Erdős-Szekeres theorem
• Quasi-optimal range searching in spaces of finite VC-dimension
• Enumerating order types for small point sets with applications
• The partitioned version of the Erdős-Szekeres theorem
• The empty hexagon theorem
• Empty convex hexagons in planar point sets
• Computing Simple Circuits from a Set of Line Segments is NP-Complete
• Sets with No Empty Convex 7-Gons
• Covering Polygons Is Hard
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On \(k\)-convex point sets