Abstract
The convexity number of a set is the minimum number of convex subsets required to cover it. We study the following question: what is the largest possible convexity number of , where is a set of points in general position in the plane? We prove that for all , . We also show that for every , if the points of are in convex position then the convexity number of is . This solves a problem of Lawrence and Morris [Finite sets as complements of finite unions of convex sets, Disc. Comput. Geom. 42 (2009), 206-218].
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.