On some partitioning problems for two-colored point sets
Year: 2009
Type: conference-paper
Abstract: Let S be a two-colored set of n points in general position in the plane. We show that S admits\nat least 2 n\n17 pairwise disjoint monochromatic triangles with vertices in S and empty of points\nof S. We further show that S can be partitioned into 3 n\n11 subsets with pairwise disjoint convex\nhull such that within each subset all but at most one point have the same color. A lower bound\non the number of subsets needed in any such partition is also given.
Language: English
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Award: G8222414138
OpenAlex ID: W2157671279
