Chromatic Variants of the Erdös-Szekeres Theorem on Points in Convex Position
Abstract
Let S be a point set in the plane in general position, such that its elements are partitioned into k classes or colors. In this paper we study several variants on problems related to the Erdös-Szekeres theorem about subsets of S in convex position, when additional chromatic constraints are considered.
Domains
Computational Geometry [cs.CG]
Origin : Files produced by the author(s)
Loading...