Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    On Erdős–Szekeres-Type Problems for k-convex Point Sets

    We study Erdős–Szekeres-type problems for k-convex point sets, a recently introduced notion that naturally extends the concept of convex position. A finite set S of n points is k-convex if there exists a spanning...

    Martin Balko, Sujoy Bhore, Leonardo Martínez Sandoval in Combinatorial Algorithms (2019)