On the Beer Index of Convexity and Its Variants

Let S be a subset of Rd\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {R}^d$$\end{document} with finite positive Lebesgue measure. The Beer index of convexityb(S)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\text {b}}(S)$$\end{document} of S is the probability that two points of S chosen uniformly independently at random see each other in S. The convexity ratioc(S)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\text {c}}(S)$$\end{document} of S is the Lebesgue measure of the largest convex subset of S divided by the Lebesgue measure of S. We investigate the relationship between these two natural measures of convexity. We show that every set S⊆R2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S\subseteq \mathbb {R}^2$$\end{document} with simply connected components satisfies b(S)⩽αc(S)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\text {b}}(S)\leqslant \alpha {\text {c}}(S)$$\end{document} for an absolute constant α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha $$\end{document}, provided b(S)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\text {b}}(S)$$\end{document} is defined. This implies an affirmative answer to the conjecture of Cabello et al. that this estimate holds for simple polygons. We also consider higher-order generalizations of b(S)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\text {b}}(S)$$\end{document}. For 1⩽k⩽d\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$1\leqslant k\leqslant d$$\end{document}, the k-index of convexitybk(S)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\text {b}}_k(S)$$\end{document} of a set S⊆Rd\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S\subseteq \mathbb {R}^d$$\end{document} is the probability that the convex hull of a (k+1)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(k+1)$$\end{document}-tuple of points chosen uniformly independently at random from S is contained in S. We show that for every d⩾2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$d\geqslant 2$$\end{document} there is a constant β(d)>0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta (d)>0$$\end{document} such that every set S⊆Rd\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S\subseteq \mathbb {R}^d$$\end{document} satisfies bd(S)⩽βc(S)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\text {b}}_d(S)\leqslant \beta {\text {c}}(S)$$\end{document}, provided bd(S)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\text {b}}_d(S)$$\end{document} exists. We provide an almost matching lower bound by showing that there is a constant γ(d)>0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma (d)>0$$\end{document} such that for every ε∈(0,1)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon \in (0,1)$$\end{document} there is a set S⊆Rd\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S\subseteq \mathbb {R}^d$$\end{document} of Lebesgue measure 1 satisfying c(S)⩽ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\text {c}}(S)\leqslant \varepsilon $$\end{document} and bd(S)⩾γεlog21/ε⩾γc(S)log21/c(S)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\text {b}}_d(S)\geqslant \gamma \frac{\varepsilon }{\log _2{1/\varepsilon }}\geqslant \gamma \frac{{\text {c}}(S)}{\log _2{1/{\text {c}}(S)}}$$\end{document}.

polygons. We also consider higher-order generalizations of b(S). For 1 k d, the k-index of convexity b k (S) of a set S ⊆ R d is the probability that the convex hull of a (k + 1)-tuple of points chosen uniformly independently at random from S is contained in S. We show that for every d 2 there is a constant β(d) > 0 such that every set S ⊆ R d satisfies b d (S) β c(S), provided b d (S) exists. We provide an almost matching lower bound by showing that there is a constant γ (d) > 0 such that for every ε ∈ (0, 1) there is a set S ⊆ R d of Lebesgue measure 1 satisfying c(S) ε and b d (S) γ ε log 2 1/ε

Introduction
For positive integers k and d and a Lebesgue measurable set S ⊆ R d , we use λ k (S) to denote the k-dimensional Lebesgue measure of S. We omit the subscript k when it is clear from the context. We also write "measure" instead of "Lebesgue measure", as we do not use any other measure in the paper.
For a set S ⊆ R d , let smc(S) denote the supremum of the measures of convex subsets of S. Since all convex subsets of R d are measurable [11], the value of smc(S) is well defined. Moreover, Goodman's result [8] implies that the supremum is achieved on compact sets S, hence it can be replaced by maximum in this case. When S has finite positive measure, let c(S) be defined as smc(S)/λ d (S). We call the parameter c(S) the convexity ratio of S.
For two points A, B ∈ R d , let AB denote the closed line segment with endpoints A and B. Let S be a subset of R d . We say that points A, B ∈ S are visible one from the other or see each other in S if the line segment AB is contained in S. For a point A ∈ S, we use Vis(A, S) to denote the set of points that are visible from A in S. More generally, for a subset T of S, we use Vis(T, S) to denote the set of points that are visible in S from T . That is, Vis(T, S) is the set of points A ∈ S for which there is a point B ∈ T such that AB ⊆ S.
Let If S is not measurable, or if its measure is not positive and finite, or if Seg(S) is not measurable, we leave b(S) undefined. Note that if b(S) is defined for a set S, then c(S) is defined as well.
We call b(S) the Beer index of convexity (or just Beer index) of S. It can be interpreted as the probability that two points A and B of S chosen uniformly independently at random see each other in S.

Previous Results
The Beer index was introduced in the 1970s by Beer [1][2][3], who called it "the index of convexity". Beer was motivated by studying the continuity properties of λ(Vis(A, S)) as a function of A. For polygonal regions, an equivalent parameter was later independently defined by Stern [19], who called it "the degree of convexity". Stern was motivated by the problem of finding a computationally tractable way to quantify how close a given set is to being convex. He showed that the Beer index of a polygon P can be approximated by a Monte Carlo estimation. Later, Rote [16] showed that for a polygonal region P with n edges the Beer index can be evaluated in polynomial time as a sum of O(n 9 ) closed-form expressions.
Cabello et al. [6] have studied the relationship between the Beer index and the convexity ratio, and applied their results in the analysis of their near-linear-time approximation algorithm for finding the largest convex subset of a polygon. We describe some of their results in more detail in Sect. 1.3.

Terminology and Notation
We assume familiarity with basic topological notions such as path-connectedness, simple connectedness, Jordan curve, etc. The reader can find these definitions, for example, in Prasolov's book [15].
Let ∂ S, S • , and S denote the boundary, the interior, and the closure of a set S, respectively. For a point A ∈ R 2 and ε > 0, let N ε (A) denote the open disc centered at A with radius ε. For a set X ⊆ R 2 and ε > 0, let N ε (X ) := A∈X N ε (A). A neighborhood of a point A ∈ R 2 or a set X ⊆ R 2 is a set of the form N ε (A) or N ε (X ), respectively, for some ε > 0.
A closed interval with endpoints a and b is denoted by [a, b]. Intervals [a, b] with a > b are considered empty. For a point A ∈ R 2 , we use x(A) and y(A) to denote the x-coordinate and the y-coordinate of A, respectively.
A polygonal curve Γ in R d is a curve specified by a sequence (A 1 , . . . , A n ) of points of R d such that Γ consists of the line segments connecting the points A i and A i+1 for i = 1, . . . , n − 1. If A 1 = A n , then the polygonal curve Γ is closed. A polygonal curve that is not closed is called a polygonal line.
A set X ⊆ R 2 is polygonally connected, or p-connected for short, if any two points of X can be connected by a polygonal line in X , or equivalently, by a selfavoiding polygonal line in X . For a set X , the relation "A and B can be connected by a polygonal line in X " is an equivalence relation on X , and its equivalence classes are the p-components of X . A set S is p-componentwise simply connected if every p-component of S is simply connected.
A line segment in R d is a bounded convex subset of a line. A closed line segment includes both endpoints, while an open line segment excludes both endpoints. For two points A and B in R d , we use AB to denote the open line segment with endpoints A and B. A closed line segment with endpoints A and B is denoted by AB.

Results
We start with a few simple observations. Let S be a subset of R 2 such that Seg(S) is measurable. For every ε > 0, S contains a convex subset K of measure at least (c(S) − ε)λ 2 (S). Two points of S chosen uniformly independently at random both belong to K with probability at least (c(S) − ε) 2  It is more challenging to find an upper bound on b(S) in terms of c(S), possibly under additional assumptions on the set S. This is the general problem addressed in this paper.
As a motivating example, observe that a set S consisting of n disjoint convex components of the same size satisfies b(S) = c(S) = 1 n . It is easy to modify this example to obtain, for any ε > 0, a simple star-shaped polygon P with b(P) 1 n − ε and c(P) 1 n , see Fig. 1. This shows that b(S) cannot be bounded from above by a sublinear function of c(S), even for simple polygons S.
For weakly star-shaped polygons, Cabello et al. [6] showed that the above example is essentially optimal, providing the following linear upper bound on b(S). Moreover, Cabello et al. [6] conjectured that even for a general simple polygon P, b(P) can be bounded from above by a linear function of c(P). (The question whether b(P) = O(c(P)) for simple polygons P was originally asked by S. Cabello and M. Saumell, personal communication to G. Rote.) The next theorem, which is the first main result of this paper, verifies this conjecture. Recall that b(S) is defined for a set S if and only if S has finite positive measure and Seg(S) is measurable. Recall also that a set is p-componentwise simply connected if its p-components are simply connected. In particular, every simply connected set is p-componentwise simply connected.

Theorem 1.3 Every p-componentwise simply connected set S
Clearly, every simple polygon satisfies the assumptions of Theorem 1.3. Hence we directly obtain the following, which verifies the conjecture of Cabello et al. [6]. The main restriction in Theorem 1.3 is the assumption that S is p-componentwise simply connected. This assumption cannot be omitted, as shown by the set S := [0, 1] 2 Q 2 , where it is easy to verify that c(S) = 0 and b(S) = 1, see Proposition 3.7.
A related construction shows that Theorem 1.3 fails in higher dimensions. To see this, consider again the set S := [0, 1] 2 Q 2 , and define a set S ⊆ R 3 by Again, it is easy to verify that c(S ) = 0 and b(S ) = 1, although S is simply connected, even star-shaped.
Despite these examples, we will show that meaningful analogues of Theorem 1.3 for higher dimensions and for sets that are not p-componentwise simply connected are possible. The key is to use higher-order generalizations of the Beer index, which we introduce now.
For k ∈ {1, . . . , d} and a set S ⊆ R d , we define the set Simp where the operator Conv denotes the convex hull of a set of points. We call Simp k (S) the k-simplex set of S. Note that Simp 1 (S) = Seg(S).
For k ∈ {1, . . . , d} and a set S ⊆ R d with finite positive measure and with measur- Note that b 1 (S) = b(S). We call b k (S) the k-index of convexity of S. We again leave b k (S) undefined if S or Simp k (S) is non-measurable, or if the measure of S is not finite and positive. We can view b k (S) as the probability that the convex hull of k + 1 points chosen from S uniformly independently at random is contained in S. For any S ⊆ R d , we We remark that the set S := [0, 1] d Q d satisfies c(S) = 0 and b 1 (S) = b 2 (S) = · · · = b d−1 (S) = 1, see Proposition 3.7. Thus, for a general set S ⊆ R d , only the d-index of convexity can conceivably admit a nontrivial upper bound in terms of c(S). Our next result shows that such an upper bound on b d (S) exists and is linear in c(S).
We do not know if the linear upper bound in Theorem 1.5 is best possible. We can, however, construct examples showing that the bound is optimal up to a logarithmic factor. This is our last main result.
The proof of Theorem 1.3 is given in Sect. 2. In Sect. 3, we will prove Theorems 1.5 and 1.6. We conclude, in Sect. 4, with some further remarks and a collection of open problems.

Bounding the Mutual Visibility in the Plane
The goal of this section is to prove Theorem 1.3. Since the proof is rather long and complicated, we first present a high-level overview of its main ideas.
We first show that it is sufficient to prove the estimate from Theorem 1.3 for bounded open simply connected sets. This is formalized by the next lemma, whose proof can be found in Sect. 2.2.

Lemma 2.1 Let α > 0 be a constant such that every bounded open simply connected
In the proof of Lemma 2.1, we first show that the set S can be reduced to a bounded open set S whose Beer index b(S ) can be arbitrarily close to b(S) from below. This is done by considering a part S of S that is contained in a sufficiently large disc and by showing that all segments in S are in fact contained in the interior of S , except for a set of measure zero. The proof is then finished by choosing S as the interior of S and by applying the assumption of the lemma to every p-component of S .
Suppose now that S is a bounded open simply connected set. We seek a bound of the form b(S) = O(c(S)). This is equivalent to a bound of the form λ 4 (Seg(S)) = O(smc(S)λ 2 (S)). We therefore need a suitable upper bound on λ 4 (Seg(S)).
We first choose in S a diagonal (i.e., an inclusion-maximal line segment in S), and show that the set S is a union of two open simply connected sets S 1 and S 2 (Lemma 2.4). It is not hard to show that the segments in S that cross the diagonal contribute to λ 4 (Seg(S)) by at most O(smc(S)λ 2 (S)) (Lemma 2.8). Our main task is to bound the measure of Seg(S i ∪ ) for i = 1, 2. The two sets S i ∪ are what we call rooted sets. Informally, a rooted set is a union of a simply connected open set S and an open segment r ⊆ ∂ S , called the root.
To bound λ 4 (Seg(R)) for a rooted set R with root r , we partition R into levels L 1 , L 2 , . . ., where L k contains the points of R that can be connected to r by a polygonal line with k segments, but not by a polygonal line with k − 1 segments. Each segment in R is contained in a union L i ∪ L i+1 for some i 1. Thus, a bound of the form We will show that each p-component of L i ∪ L i+1 is a rooted set, with the extra property that all its points are reachable from its root by a polygonal line with at most two segments (Lemma 2.5). To handle such sets, we will generalize the techniques that Cabello et al. [6] have used to handle weakly star-shaped sets in their proof of Theorem 1.1. We will assign to every point A ∈ R a set T(A) of measure O(smc(R)), such that for every (A, B) ∈ Seg(R), we have either B ∈ T(A) or A ∈ T(B) (Lemma 2.7). From this, Theorem 1.3 will follow easily.

Proof of Theorem 1.3 for Bounded Open Simply Connected Sets
First, we need a few auxiliary lemmas. Proof The statement is trivially true if and intersect or have the same supporting line, or if Vis( , S) ∩ is empty. Suppose that these situations do not occur. Let A, B ∈ and A , B ∈ be such that A A , B B ⊆ S. The points A, A , B , B form a (possibly self-intersecting) tetragon Q whose boundary is contained in S. Since S is simply connected, the interior of Q is contained in S. If Q is not self-intersecting, then clearly AB ⊆ Vis( , S). Otherwise, A A and B B have a point D in common, and every point C ∈ AB is visible in R from the point C ∈ A B such that D ∈ CC . This shows that Vis( , S) ∩ is a convex subset and hence a subsegment of . Now, we define rooted sets and their tree-structured decomposition, and we explain how they arise in the proof of Theorem 1.3.
A set S ⊆ R 2 is half-open if every point A ∈ S has a neighborhood N ε (A) that satisfies one of the following two conditions: The condition 1 holds for points A ∈ S • , while the condition 2 holds for points A ∈ ∂ S. A set R ⊆ R 2 is a rooted set if the following conditions are satisfied: 1. R is bounded, 2. R is p-connected and simply connected, The following lemma allows us to use a diagonal to split a bounded open simply connected subset of R 2 into two rooted sets. It is intuitively clear, and its formal proof is postponed to Sect. 2.3.

Lemma 2.4 Let S be
a bounded open simply connected subset of R 2 , and let be a diagonal of S. It follows that the set S has two p-components S 1 and S 2 . Moreover, S 1 ∪ and S 2 ∪ are rooted sets, and is their common root.
Let R be a rooted set. For a positive integer k, the kth level L k of R is the set of points of R that can be connected to the root of R by a polygonal line in R consisting of k segments but cannot be connected to the root of R by a polygonal line in R consisting of fewer than k segments. We consider a degenerate one-vertex polygonal line as consisting of one degenerate segment, so the root of R is part of L 1 . Thus Fig. 2 for an example of a rooted set and its partitioning into levels and bodies.
We say that a rooted set P is attached to a set Q ⊆ R 2 P if the root of P is subset of the interior of P ∪ Q. The following lemma explains the structure of levels and bodies. Although it is intuitively clear, its formal proof requires quite a lot of work and can be found in Sect. 2.4.

Lemma 2.5
Let R be a rooted set and (L k ) k 1 be its partition into levels. It follows that 1. R = k 1 L k ; consequently, R is the union of all its bodies; 2. every body P of R is a rooted set such that P = Vis(r, P), where r denotes the root of P; Lemma 2.5 yields a tree structure on the bodies of R. The root of this tree is the unique 1-body L 1 of R, called the root body of R. For a k-body P of R with k 2, the parent of P in the tree is the unique (k − 1)-body of R that P is attached to, called the parent body of P. Lemma 2.6 Let R be a rooted set, (L k ) k 1 be the partition of R into levels, be a closed line segment in R, and k 1 be minimum such that ∩ L k = ∅. It follows that ⊆ L k ∪ L k+1 , ∩ L k is a subsegment of contained in a single k-body P of R, and ∩ L k+1 consists of at most two subsegments of each contained in a single (k + 1)-body whose parent body is P.
Proof The definition of the levels directly yields ⊆ L k ∪ L k+1 . The segment splits into subsegments each contained in a single k-body or (k + 1)-body of R. By Lemma 2.5, the bodies of any two consecutive of these subsegments are in the parentchild relation of the body tree. This implies that ∩ L k lies within a single k-body P. By Lemma 2.3, ∩ L k is a subsegment of . Consequently, ∩ L k+1 consists of at most two subsegments.
In the setting of Lemma 2.6, we call the subsegment ∩ L k of the base segment of , and we call the body P that contains ∩ L k the base body of . See Fig. 2 for an example.
The following lemma is the crucial part of the proof of Theorem 1.3.

Lemma 2.7
If R is a rooted set, then every point A ∈ R can be assigned a measurable set T(A) ⊆ R 2 so that the following is satisfied: Proof Let P be a body of R with the root r . First, we show that P is entirely contained in one closed half-plane defined by the supporting line of r . Let h − and h + be the two open half-planes defined by the supporting line of r . According to the definition of a rooted set, the sets {D ∈ r : ∃ε > 0 : } are open and partition the entire r , hence one of them must be empty. This implies that the segments connecting r to P r lie all in h − or all in h + . Since P = Vis(r, P), we conclude that P ⊆ h − or P ⊆ h + .
According to the above, we can rotate and translate the set R so that r lies on the x-axis and P lies in the half-plane {B ∈ R 2 : y(B) 0}. For a point A ∈ R, we use d(A, r ) to denote the y-coordinate of A after such a rotation and translation of R.
Let γ ∈ (0, 1) be a fixed constant whose value will be specified at the end of the proof. For a point A ∈ R, we define sets where r denotes the root of the base body of AB and A and B denote the endpoints of the base segment of AB such that |A For the rest of the proof, we fix a point A ∈ R. We show that the union 3 i=1 V i (A) is contained in a measurable set T(A) ⊆ R 2 with λ 2 (T(A)) < 87 smc(R) that is a union of three trapezoids. We let P be the body of A and r be the root of P. If P is a k-body with k 2, then we use r to denote the root of the parent body of P.
Let H be a point of r such that AH ⊆ R. Let T be the r -parallel trapezoid of height d(A) with bases of length 8 smc(R) d(A) and 4 smc(R) d(A) such that A is the center of the larger base and H is the center of the smaller base. The homothety with center A and ratio γ −1 transforms T into the trapezoid T : Fig. 3 for an illustration.
Let B be a point in V 1 (A). Using a similar approach to the one used by Cabello et al. [6] in the proof of Theorem where r denotes the root of the base level of AB. Since A is visible from r in R, the base body of AB is the body of A and thus A = A and r = r . As we have observed, every point The points A, E, F, H form a self-intersecting tetragon Q whose boundary is contained in R. Since R is simply connected, the interior of Q is contained in R and the triangles AC E and C F H have area at most smc(R).
The triangle AC E is partitioned into triangles AD E and C DE with areas .
For the triangle C F H, we have 1 2 d(C)|F H| = λ 2 (C F H) smc(R). By the similarity of the triangles C F H and C DE, we have |F H| = |DE|d(C)/(d(E) − d(C)) and therefore Since the first upper bound on |DE| is increasing in d(C) and the second is decreasing in d(C), the minimum of the two is maximized when they are equal, that is, when Since ε can be made arbitrarily small and T is compact, we have B ∈ T . Since |AB | γ |AB|, we conclude that B ∈ T . This completes the proof of Claim 1.
We assume the point A is not contained in the first level of R, as otherwise V 2 (A) is empty. Let p be the r -parallel line that contains the point A and let q be the supporting line of r . Let p + and q + denote the closed half-planes defined by p and q, respectively, such that r ⊆ p + and A / ∈ q + . Let O be the intersection point of p and q. Let T ⊆ p + ∩ q + be the trapezoid of height d(A, r ) with one base of length  Fig. 4 for an illustration.
Let B be a point of V 2 (A). We use A B to denote the base segment of AB such that where r denotes the root of the base body of AB. By Lemma 2.6 and the fact that The upper bound is trivial, as d(B, r ) d(A, r ) and A lies on AB. For the lower bound, we use the expression

This can be rewritten as |A
Let (G n ) n∈N be a sequence of points from A B that converges to A . For every n ∈ N, there is a point H n ∈ r such that G n H n ⊆ R. Since r is compact, there is a subsequence of (H n ) n∈N that converges to a point H 0 ∈ r . We claim that H 0 ∈ q.
Suppose otherwise, and let q = q be the supporting line of A H 0 . Let ε > 0 be small enough so that N ε (A ) ⊆ R. For n large enough, G n H n is contained in an arbitrarily small neighborhood of q . Consequently, for n large enough, the supporting line of G n H n intersects q at a point K n such that G n K n ⊆ N ε (A ), which implies K n ∈ r ∩ Vis(r , R), a contradiction.
The point E lies on A B and thus it is visible from a point F ∈ r . Again, we can choose F so that the line segments E F and G H have a point C in common where C = F, H . The points E, F, H, G form a self-intersecting tetragon Q whose boundary is in R. The interior of Q is contained in R, as R is simply connected. Therefore, the area of the triangles C EG and C F H is at most smc(R).
The argument used in the proof of Claim 1 yields This and the fact that δ (and consequently |D D|) can be made arbitrarily small yield Since ε can be made arbitrarily small and T is compact, we have B ∈ T . Since |A B | γ |AB| γ |A B|, we conclude that B ∈ T . This completes the proof of Claim 2.
By Lemma 2.3, the points of r that are visible from A in R form a subsegment C D of r . The homothety with center A and ratio 2(1 − γ ) −1 transforms the triangle T := AC D into the triangle T : The area of T is at most smc(R), as its interior is a convex subset of R. Consequently, the area of T is at most (4(1 − γ ) −2 − 1) smc(R). This completes the proof of Claim 3.
To put everything together, we set T(A) : Then, it follows that  The following lemma is a slightly more general version of a result of Cabello et al. [6]. Proof of Theorem 1.3 In view of Lemma 2.1, we can assume without loss of generality that S is a bounded open simply connected set. Let be a diagonal of S. We can assume without loss of generality that lies on the x-axis.
According to Lemma 2.4, the set S has exactly two p-components S 1 and S 2 , the sets S 1 ∪ and S 2 ∪ are rooted sets, and is their common root. By Lemma 2.7, It follows that the set S is measurable. Let where the second inequality is implied by Fubini's Theorem. The bound λ 2 (S(A)) 90 smc(S) implies Finally, this bound can be rewritten as b(S) = λ 4 (Seg(S))λ 2 (S) −2 180 c(S).

Proof of Lemma 2.1
In this section, we prove Lemma 2.1, which reduces the general setting of Theorem 1.3 to the case that S is a bounded open simply connected subset of R 2 .
be an open ball in R 2 centered at the origin. Consider the sets S = S ∩ B and S 0 = S B partitioning the set S. Fix the radius of B large enough, so that S 0 has measure at most ελ(S)/2. We claim that S has the properties stated in the lemma. Clearly as claimed. It is clear from the construction that if S is p-componentwise simply connected, then so is S . Let AB be a segment contained in S, and let C be a point of AB. We say that C is an isolated boundary point of the segment AB, if C ∈ ∂ S, but there is an ε > 0 such that no other point of AB ∩ N ε (C) belongs to ∂ S.
We partition the set B into four parts as follows: We claim that each of these sets has measure zero. For B | , this is clear, since B | is a subset of {(A, B) ∈ R 2 × R 2 : A = B or AB is a vertical segment}, which clearly has λ 4 -measure zero. Consider now the set B . We first argue that it is measurable.
showing that B is measurable. An analogous argument shows that B is measurable, and hence B • is measurable as well.
In the rest of the proof, we will use two basic facts of integral calculus, which we now state explicitly.  Let us prove that λ 4 (B ) = 0. The basic idea is as follows: suppose that we have fixed a non-vertical line L and a point B ∈ L. It can be easily seen that there are at most countably many points A ∈ L such that (A, B) ∈ B . Since a line L with a point B ∈ L can be determined by three parameters, we will see that B has λ 4 -measure zero.
Let us describe this reasoning more rigorously. Let  : (a, b, x, x ) ∈ B }. We claim that X a,b,x is countable. To see this, choose a point x ∈ X a,b,x and define (A, B) := σ (a, b, x, x ). Since (A, B) ∈ B , we know that A is an isolated boundary point of AB, which implies that there is a closed interval β ⊆ R of positive length such that β ∩ X a,b,x = {x}. This implies that X a,b,x is countable and thus of measure zero.
Since B is measurable, we can apply Fubini's Theorem to get Therefore λ 4 ( B ) = 0 as claimed. A similar argument shows that λ 4 ( B ) = 0.
It remains to deal with the set B • . We will use the following strategy: we will fix two parallel non-horizontal lines L 1 , L 2 , and study the segments orthogonal to these two lines, with one endpoint on L 1 and the other on L 2 . Roughly speaking, our goal is to show that for "almost every" choice of L 1 and L 2 , there are "almost no" segments of this form belonging to B • .
Let L a,b denote the (non-horizontal) line {(ay + b, y) : y ∈ R}. Let us say that a pair of distinct points (A, B) has type (a, b, c), if A ∈ L a,b , B ∈ L a,c , and the segment AB is orthogonal to L a,b (and therefore also to L a,c ). The value a is then called the slope of the type t = (a, b, c).
Note that every pair of distinct points (A, B) defining a non-vertical segment has a unique type (a, b, c), with b = c. Define a mapping τ : τ (a, b, c, y) is the pair of points (A, B) of type (a, b, c) such that A = (ay + b, y). Note that τ is a bijection from the set {(a, b, c, y A, B not on the same vertical line}. We can easily verify that τ satisfies the assumptions of Fact 1. Define In our applications, α will always be an interval (in fact, an open interval with rational endpoints), and in such case we already know that B By Fubini's Theorem, we have Y (a,b,c) ), and Y t is measurable for all t ∈ R 3 up to a set of λ 3 -measure zero. An analogous formula holds for B • (α) and Y t (α) for any open interval α ⊆ [0, 1] with rational endpoints. Since there are only countably many such intervals, and a countable union of sets of measure zero has measure zero, we know that there is a set T 0 ⊆ R 3 of measure zero, such that for all t ∈ R 3 T 0 the set Y t is measurable, and moreover for any rational interval α the set Y t (α) is measurable as well.
Our goal is to show that there are at most countably many slopes a ∈ R for which there is a (b, c) ∈ R 2 such that λ 1 (Y (a,b,c) ) > 0. From (*) it will then follow that λ 4 (B • ) = 0. To achieve this goal, we will show that to any type t for which λ 1 (Y t ) > 0, we can assign a set R t ⊆ ∂ S of positive λ 2 -measure (the region of t), so that if t and t have different slopes and if Y t and Y t both have positive measure, then R t and R t are disjoint. Since there cannot be uncountably many disjoint sets of positive measure, this will imply the result.
Let us fix a type t = (a, b, c) ∈ R 3 T 0 such that λ 1 (Y t ) > 0. Let us say that an element y ∈ Y t is half-isolated if there is an ε > 0 such that [y, y + ε] ∩ Y t = {y} or [y − ε, y] ∩ Y t = {y}. Clearly, Y t has at most countably many half-isolated elements. Define Y * t := {y ∈ Y t : y is not half-isolated}. Of course, λ 1 (Y * t ) = λ 1 (Y t ). See Fig. 6 for an illustration.  τ (a, b, c, y). We claim that A y B y ∩ S • is either empty or a single interval. Let us choose any two points C, D ∈ A y B y ∩ S • . We will show that the segment C D is inside S • . For ε > 0 small enough, the neighborhoods N ε (C) and N ε (D) are subsets of S. Since y is not half-isolated in Y t , we can find two segments P, Q ∈ B • of type t that intersect both N ε (C) and N ε (D), with A y B y being between P and Q. We can then find a closed polygonal curve Γ ⊆ P ∪ Q ∪ N ε (C) ∪ N ε (D) whose interior region contains C D. Since S is p-componentwise simply connected, we see that C D ⊆ S • . Therefore, A y B y ∩ S • is indeed an interval.
Since ∂ S is a closed set, we know that for every y ∈ Y * t , the set A y B y ∩ ∂ S is closed as well. Moreover, neither A y nor B y are isolated boundary points of A y B y , because then (A y , B y ) would belong to B or B . We conclude that A y B y ∩ ∂ S is either equal to a single closed segment of positive length containing A y or B y , or it is equal to a disjoint union of two closed segments of positive length, one of which contains A y and the other contains B y .
For an integer n ∈ N, define two sets Y t (n) and Y t (n) by Note that these sets are measurable: for instance, Y t (n) is equal to Y * t α Y t (α) , where we take the union over all rational intervals α intersecting (0, n −1 ). Moreover, we have Y * t = n∈N (Y t (n) ∪ Y t (n)). It follows that there is an n such that Y t (n) or Y t (n) has positive measure. Fix such an n and assume, without loss of generality, that λ 1 (Y t (n)) is positive. Define the region of t, denoted by R t , by The set R t is a bijective affine image of Y t (n) × (0, n −1 ), and in particular it is λ 2 -measurable with positive measure. Note that R t is a subset of ∂ S.
Consider now two types t, t ∈ R 3 T 0 with distinct slopes, such that both Y t and Y t have positive measure. We will show that the regions R t and R t are disjoint.
For contradiction, suppose there is a point C ∈ R t ∩ R t . Let AB and A B be the segments containing C and having types t and t , respectively. Fix ε > 0 small enough, so that none of the four endpoints A, B, A , B lies in N ε (C). Since Y * t has no half-isolated points of Y t , we know that B • has segments of type t arbitrarily close to AB on both sides of AB, and similarly for segments of type t close to A B . We can therefore find four segments P, Q, P , Q ∈ B • {AB, A B } with these properties: -P and Q have type t, and P and Q have type t .
-AB is between P and Q (i.e., AB ⊆ Conv(P ∪ Q)) and A B is between P and Q . -Both P and Q intersect both P and Q inside N ε (C).
We see that the four points where P ∪ Q intersects P ∪ Q form the vertex set of a parallelogram W whose interior contains the point C. Moreover, the boundary of W is a closed polygonal curve contained in S. Since S is p-componentwise simply connected, W is a subset of S and C belongs to S • . This is a contradiction, since all points of R t (and R t ) belong to ∂ S.
We conclude that R t and R t are indeed disjoint. Since there cannot be uncountably many disjoint sets of positive measure in R 2 , there are at most countably many values a ∈ R for which there is a type t = (a, b, c) with λ 1 (Y t ) positive. Consequently, the right-hand side of (*) is zero, and so λ 4 (B • ) = 0, as claimed.
Proof of Lemma 2.1 Observe that the inequalities b(S) α c(S) and λ 4 (Seg(S)) α smc(S)λ 2 (S) are equivalent. Call a set S bad if Seg(S) is measurable and b(S) > α c(S) or equivalently λ 4 (Seg(S)) > α smc(S)λ 2 (S). To prove the lemma, we suppose for the sake of contradiction that there exists a bad p-componentwise simply connected set S ⊆ R 2 of finite positive measure.
By Lemma 2.9, for each ε > 0, there is a bounded p-componentwise simply connected set S ⊆ S such that λ 2 (S ) In particular, such a set S satisfies c(S ) c(S)/(1 − ε). Hence, for ε small enough, the set S is bad.
Note that S is p-componentwise simply connected. Since S is an open set, all its p-components are open as well. In particular, S has at most countably many p-components. Let C be the set of p-components of S . Each T ∈ C is a bounded open simply connected set, and therefore cannot be bad. Therefore, showing that S is not bad. This is a contradiction.

Proof of Lemma 2.4
Here we prove Lemma 2.4, which says that every bounded open simply connected subset of R 2 can can be split by a diagonal into two rooted sets.

Lemma 2.11 Let S be a bounded open simply connected subset of R 2 , and let be a diagonal of S. Let h − and h + be the open half-planes defined by the supporting line of . It follows that the set S has exactly two p-components S 1 and S 2 . Moreover, for every point A ∈ and every neighborhood N ε (A) ⊆ S, we have N ε (A)∩h
Proof Notice first that any p-component of an open set is also open. This implies that any path-connected open set is also p-connected, and therefore every open simply connected set is p-connected as well.
Let A ∈ , and let N ε (A) be a neighborhood of A contained in S. We choose arbitrary points B ∈ N ε (A) ∩ h − and C ∈ N ε (A) ∩ h + . Suppose for a contradiction that S has a single p-component. Then there exists a polygonal curve Γ in S with endpoints B and C. Let ⊆ S be the closed polygonal curve Γ ∪ BC. We can assume that the curve is simple using a local redrawing argument. See Fig. 7.
The curve separates R 2 into two regions. The closure of the diagonal is a closed line segment that intersects in exactly one point. It follows that one endpoint of is in the interior region of . Since the endpoints of do not belong to S, this contradicts the assumption that S is simply connected. Now, we show that the set S has at most two p-components. For a point D ∈ , let N ε (D) be a neighborhood of D in S. The set N ε (D) ∩ h − is contained in a unique p-component S 1 of S , and N ε (D) ∩ h + is contained in a different p-component S 2 . Choose another point E ∈ with a neighborhood N ε (E) ⊆ S. We claim that N ε (E)∩h − also belongs to S 1 . To see this, note that since DE is a compact subset of the open set S, it has a neighborhood N δ (DE) which is contained in S. Clearly, N δ (DE)∩h − is p-connected and therefore belongs to S 1 , hence N ε (E)∩h − belongs to S 1 as well. An analogous argument can be made for the half-plane h + and the p-component S 2 .
Since for every p-component S of S , there is a point A ∈ and a neighborhood N ε (A) ⊆ S such that N ε (A) ∩ S = ∅, we see that S 1 and S 2 are the only two p-components of S .
Proof of Lemma 2.4 By Lemma 2.11, the set S has of exactly two p-components S 1 and S 2 . It remains to show that S 1 ∪ and S 2 ∪ are rooted sets.
Since S 1 and S 2 are p-connected, S 1 ∪ and S 2 ∪ are p-connected as well. To show that S 1 ∪ and S 2 ∪ are simply connected, choose a Jordan curve Γ in, say, S 1 ∪ , and let Z be the interior region of Γ . Suppose for a contradiction that Z is not a subset of S 1 ∪ . Since S is simply connected, we have Z ⊆ S. Hence there is a point A ∈ Z ∩ S 2 . Since both S 2 and Z are open, we can assume that A does not lie on the supporting line of . Let AB be the minimal closed segment parallel to such that B ∈ Γ . Then B belongs to S 1 , A belongs to S 2 , and yet A and B are in the same p-component of S . This contradiction shows that S 1 ∪ and S 2 ∪ are simply connected.
As subsets of the bounded set S, the sets S 1 ∪ and S 2 ∪ are bounded. Lemma 2.11 and the fact that S i is open imply that the set S i ∪ is half-open and S i ∩ ∂ S i = for i ∈ {1, 2}. Therefore, the sets S 1 ∪ and S 2 ∪ are rooted, and is their root.

Proof of Lemma 2.5
Here we prove Lemma 2.5, which explains the tree structure of rooted sets. For this entire section, let R be a rooted set and (L k ) k 1 be the partition of R into levels. We will need several auxiliary results in order to prove Lemma 2.5.
For disjoint sets S, T ⊆ R 2 , we say that the set S is T -half-open if every point A ∈ S has a neighborhood N ε (A) that satisfies one of the following two conditions:  N ε B (B) satisfies the condition 2 for R being half-open. Since AB is compact, there is a finite set X ⊆ AB such that AB ⊆ C∈X N ε C /2 (C). Hence N ε (AB) ⊆ C∈X N ε C (C), where ε := min C∈X ε C /2. It follows that N ε (AB) ∩ ∂ R is an open segment Q containing B but not A and splitting N ε (AB) into two subsets, one of which (including Q) is N ε (AB) ∩ R and the other (excluding Q) is N ε (AB) R. Let ε be the minimum of ε and the distance of A to the line containing Q. It follows that N ε (A) ⊆ N ε (AB) ∩ R. Therefore, for every A ∈ N ε (A), we have A B ⊆ R, hence N ε (A) ⊆ L 1 . It also follows that We say that a set P ⊆ R is R-convex when the following holds for any two points A, B ∈ P: if AB ⊆ R, then AB ⊆ P.

Lemma 2.13
The set L 1 is R-convex.
Proof This follows directly from Lemma 2.3.
A branch of R is a p-component of k 2 L k .

Lemma 2.14 Every branch of R is R-convex.
Proof Let P be a branch of R, and let A, B ∈ P be such that There is a simple polygonal line in P connecting A with B , which together with A B forms a Jordan curve Γ in R. Now, let C ∈ A B . Since C ∈ L 1 , there is a point D on the root of R such that C D ⊆ R. Since A , B / ∈ L 1 , D does not lie on the supporting line of A B . Extend the segment DC beyond C until hitting ∂ R at a point C . Here we use the fact that R is bounded. Since R is simply connected, the entire interior region of Γ is contained in R, so the points D and C both lie in the exterior region of Γ . However, since Γ ∩ L 1 = A B , the line segment DC crosses Γ at exactly one point, which is C. This is a contradiction.

Lemma 2.15
The set L 1 and every branch of R are p-connected and simply connected.
Proof Let P be the set L 1 or a branch of R. It follows directly from the definitions of L 1 and a branch of R that P is p-connected. To see that P is simply connected, let Γ be a Jordan curve in P, A be a point in the interior region of Γ , and BC be an inclusion-maximal open line segment in the interior region of Γ such that A ∈ BC. It follows that B, C ∈ Γ and BC ⊆ R, as R is simply connected. Since B, C ∈ P and P is R-convex (Lemmas 2.13 and 2.14), we have A ∈ P.

Lemma 2.16 Every branch of R is L 1 -half-open.
Proof Let P be a branch of R. It is enough to check the condition 1 or 2 for P being L 1 -half-open for points in ∂ P ∩ P. Let A ∈ ∂ P ∩ P. Since R is half-open, A has a neighborhood N ε (A) that satisfies the condition 1 or 2 for S being half-open. It cannot be 2, as then A would lie on the root of R and thus in L 1 . Hence N ε (A) ⊆ R.
Since L 1 is (R 2 R)-half-open (Lemma 2.12) and R-convex (Lemma 2.13) and A / ∈ L 1 , the set N ε (A) ∩ L 1 lies entirely in some open half-plane h whose boundary line passes through A. The set N ε (A) h is p-connected and contains A, so it lies entirely within P. The set N ε (A) ∩ h is disjoint from P. Indeed, if there was a point B ∈ N ε (A) ∩ h ∩ P, then by the R-convexity of P (Lemma 2.14), the convex hull of N ε (A) h and B would lie entirely within P and would contain A in its interior, which would contradict the assumption that A ∈ ∂ P. It follows that N ε (A) ∩ ∂ P is an open segment that partitions N ε (A) into two half-discs, one of which (including Since N ε (A ) is p-connected and contains a point of P, it lies entirely within P. This contradicts the assumption that A ∈ ∂ P. Since The latter implies that A C ⊆ P, as A ∈ P. Hence C = A . This shows the whole triangle T spanned by N ε (A) ∩ ∂ P and B excluding the open segment N ε (A) ∩ ∂ P is contained in L 1 .
Since A lies in the interior of N ε (A) ∩ (P ∪ T ), it has a neighborhood N ε (A) that lies entirely within N ε (A) ∩ (P ∪ T ). This neighborhood witnesses the condition 2 for P being L 1 -half-open.

Lemma 2.17 Let P be a branch of R. If
There is a polygonal line Γ 1 in P connecting A 0 with A 1 , and a polygonal line Γ 2 in L 1 connecting B 0 with B 1 . These polygonal lines together with the line segments A 0 B 0 and A 1 B 1 form a closed polygonal curve Γ in R. We can assume without loss of generality that Γ is simple (see Fig. 7) and that the x-coordinates of A 0 and A 1 are equal to 0. We also assume that no two vertices of Γ except A 0 and A 1 have the same x-coordinates.
We color the points of Γ ∩ L 1 red and the points of Γ ∩ P blue. For convenience, we assume that A 0 and A 1 have both colors. Let Z denote the interior region delimited by Γ including Γ itself. Since R is simply connected, we have Z ⊆ R.
Let x 1 < · · · < x n be the x-coordinates of all vertices of Γ . We use [n] to denote the set of indices {1, . . . , n}. Since the x-coordinates of A 0 and A 1 are zero, there is j ∈ [n] such that x j = 0. For i ∈ [n], we let i be the vertical line {x i } × R. Since the x-coordinates of the vertices of Γ {A 0 , A 1 } are distinct, there is at most one vertex of Γ on i for every i ∈ [n] { j}. For i ∈ [n], the intersection of Z with i is a family of closed line segments with endpoints from Γ ∩ i . Some of the segments can be trivial, that is, consisting of a single point, and some segments can contain a point of Γ in their interior.
For i ∈ [n] and a point A ∈ Γ ∩ i , we say that a point B is a left neighbor of A if B lies on Γ ∩ i−1 and AB ⊆ Γ . Similarly, B is a right neighbor of A if B ∈ Γ ∩ i+1 and AB ⊆ Γ . Note that every point A ∈ Γ ∩ i has exactly two neighbors and if A / ∈ {A 0 , A 1 }, then the neighbors of A have the same color as A. We distinguish two types of points of Γ ∩ i . We say that a point A ∈ Γ ∩ i is one-sided if it either has two right or two left neighbors. Otherwise, we say that A is two-sided. That is, A is two-sided if it has one left and one right neighbor. See Fig. 8. First, we will prove the claim by induction on i for all i < j. The claim clearly holds for i = 1, as Z ∩ 1 contains only a single vertex of Γ . Fix i with 1 < i < j and suppose that the claim holds for i − 1. Let C, D ∈ Γ ∩ i be points satisfying C D ⊆ Z ∩ i . We show that C and D have the same color. Obviously, we can assume that the line segment C D is non-trivial. Assume first that the points C and D are two-sided.
Suppose the interior of C D does not contain a point of Γ with a left neighbor. Let A, B ∈ Γ ∩ i−1 be the left neighbors of C and D, respectively. Then AB ⊆ Z ∩ i−1 . Thus A and B have the same color by the induction hypothesis. Since C, D / ∈ {A 0 , A 1 }, the points A and C have the same color as well as the points B and D. This implies that C and D have the same color too. If there is a point E of Γ in the interior of C D, then it follows from R-convexity of P (Lemma 2.14) and L 1 (Lemma 2.13) that E has the same color as C and D. Now, suppose the interior of C D contains a point E of Γ with a left neighbor. We have already observed that there is exactly one such point on C D. We also know that E has two left neighbors. The points C and E with their left neighbors A and B, respectively, where there is no left neighbor of E between A and B on i−1 , form a trapezoid in Z such that AB ⊆ Z ∩ i−1 . From induction hypothesis A and B have the same color which implies that C and E have the same color as well. Similarly, D and E have the same color which implies that C and D have the same color as well.
The case where either C or D is one-sided is covered by the previous cases. The same inductive argument but in the reverse direction shows the claim for all i with j < i n. This completes the proof of the claim. Now, consider the inclusion-maximal line segment C D of Z ∩ j that contains A 0 . We can assume that either C and D are two-sided. Suppose for a contradiction that A 1 is not contained in C D. If C D is trivial, that is, C = D = A 0 , then A 0 is one-sided and its neighbors A and B have different colors, as Γ changes color in A 0 . This is impossible according to the claim, since we have AB ⊆ Z ∩ i−1 or AB ⊆ Z ∩ i+1 . Therefore C D is non-trivial.
First, we assume that A 0 is an endpoint of C D, say C = A 0 . Then A 0 is two-sided. By symmetry, we can assume that the left neighbor A of A 0 and the left neighbor B of D have different colors. If there is no point of Γ with a left neighbor in the interior of A 0 D, then AB ⊆ Z ∩ i−1 . This is impossible according to the claim. If there is a point E ∈ Γ with a left neighbor in the interior of A 0 D, then we can use a similar argument either for the line segment A 0 E or for E D, as the neighbors of E have the same color. The last case is when A 0 is an interior point of C D. Since Γ does not change color in C nor in D, we apply the claim to one of the line segments A 0 C, A 0 D, and C D and show, again, that none of the cases is possible. Altogether, we have derived a contradiction.
Therefore, A 0 and A 1 are contained in the same line segment of Z ∩ i . This completes the proof, as Z ⊆ R.

Lemma 2.18 For every branch P of R, the set P ∩ ∂ P is an open segment.
Proof Let P be a branch of R. First, we show that the set P ∩ ∂ P is convex. Let A 0 , A 1 ∈ P ∩ ∂ P. By Lemma 2.17, we have A 0 A 1 ⊆ R. It follows that A 0 A 1 is disjoint from the root of R and thus is contained in R • . By compactness, 1]. Now, it follows from the R-convexity of P (Lemma 2.14) and L 1 (Lemma 2.13) that A t ∈ P and A t B t {A t } ⊆ L 1 , hence A t ∈ P ∩ ∂ P, for all t ∈ [0, 1]. This shows that P ∩ ∂ P is convex.
If P ∩ ∂ P had three non-collinear points, then they would span a triangle with non-empty interior contained in P ∩ ∂ P, which would be a contradiction. Since R is bounded, the set P ∩ ∂ P is a line segment. That it is an open line segment follows directly from Lemma 2.16.

Lemma 2.19
For every j 2, every p-component P of k j L k is a rooted set attached to L j−1 . Moreover, for k 1, the kth level of P is equal to L j−1+k ∩ P.
Proof The proof proceeds by induction on j. For the base case, let P be a p-component of i 2 L i , that is, a branch of R. It follows from Lemmas 2.15, 2.16 and 2.18 that P is a rooted set attached to L 1 . Let be the root of P, and let (L k ) k 1 be the partition of P into levels. We prove that L k ⊆ k+1 i=1 L i and L k+1 ∩ P ⊆ k i=1 L i for every k 1. Let A ∈ L k . It follows that there is a polygonal line Γ with k line segments connecting A to a point B ∈ . Moreover, since there is no shorter polygonal line connecting A to , the last line segment of Γ is not parallel to . Since P is L 1 -halfopen (Lemma 2.16), there is a neighborhood N ε (B) that is split by into two parts, one of which is a subset of L 1 . Let C be a point in N ε (B)∩ L 1 such that BC is an extension of the last line segment of Γ . Since C ∈ L 1 , there is a point D on the root of R such that C D ⊆ L 1 . The polygonal line Γ extended by BC and C D forms a polygonal line with k +1 line segments connecting A to the root of R. This shows that L k ⊆ k+1 i=1 L i . Now, let A ∈ L k+1 ∩ P. It follows that there is a polygonal line Γ with k + 1 line segments connecting A to the root of R. Since L 1 is an open subset of R (Lemma 2.12) and P is a p-component of R L 1 , there is a point B ∈ Γ such that the part of Γ between A and B (inclusive) is contained in P and is maximal with this property. It follows that B ∈ . Since B / ∈ L 1 , the part of Γ between A and B consists of at most k segments. This shows that L k+1 ∩ P ⊆ k i=1 L i . We have thus proved that L k ⊆ k+1 i=1 L i and L k+1 ∩ P ⊆ k i=1 L i for every k 1. To conclude the proof of the base case, we note that a straightforward induction shows that L k = L k+1 ∩ P for every k 1.
For the induction step, let j 3, and let P be a p-component of i j L i . Let Q be the branch of R containing P. Let (L k ) k 1 be the partition of Q into levels. As we have proved for the base case, we have L k = L k+1 ∩ Q for every k 1. Hence P is a p-component of ( i j L i ) ∩ Q = i j−1 L i . By the induction hypothesis, P is a rooted set attached to L j−2 ⊆ L j−1 . Moreover, for k 1, the kth level of P is equal to L j−2+k ∩ P = L j−1+k . This completes the induction step and proves the lemma.
Proof of Lemma 2.5 The statement 1 is a direct consequence of the definition of a rooted set, specifically, of the condition that a rooted set is p-connected.
For the proof of the statement 2, let P be a j-body of R. If j = 1, then P = L 1 = Vis(r, R) = Vis(r, L 1 ), where r is the root of R, and by Lemmas 2.12 and 2.15, L 1 is rooted with the same root r . Now, suppose j 2. Let Q be the p-component of k j L k containing P. By Lemma 2.19, Q is a rooted set and L j ∩ Q is the first level of Q. Since P ⊆ L j ∩ Q, the definition of the first level yields P = L j ∩ Q = Vis(r, Q) = Vis(r, P), where r is the root of Q. By Lemma 2.12, P is a rooted set with the same root r . Lemma 2.12 and the fact that L 1 is p-connected directly yield the statement 3. Finally, for the proof of the statement 4, let P be a j-body of R with j 2. Let Q be the p-component of k j L k containing P. As we have proved above, Q is a rooted set and P is the first level of Q and shares the root with Q. Moreover, by Lemma 2.19, Q (and hence P) is attached to L j−1 . The definition of attachment implies that P is attached to a single p-component of L j−1 , that is, a single ( j − 1)-body of R.

Proof of Theorem 1.5
Let T = (B 0 , B 1 , . . . , B d ) be a (d + 1)-tuple of distinct affinely independent points in R d . We say that a permutation B 0 , B 1 , . . . , B d of T is a regular permutation of T if the following two conditions hold: We point out that T is considered to be affinely dependent in the above definitions of X and Y i also in the degenerate case when some point of S appears more than once in T . We have λ d(d+1) (X ) = 0. Let i ∈ {0, . . . , d}. The set Y i is a subset of the set This completes the proof of Theorem 1.5.

Proof of Theorem 1.6
In the following, we make no serious effort to optimize the constants. As the first step towards the proof of Theorem  Fig. 9 The inductive splitting of S = (0, 1) 2 N with respect to the point A 1 . The points B 1 , B 2 , B 3 of N are denoted as empty circles and we use a shorthand P i for P i (A 1 ) where [φ] is the characteristic function of a logical expression φ, that is, [φ] equals 1 if the condition φ holds and 0 otherwise. For the measure of R we then derive Since the function x → x 2 is convex, we can apply Jensen's inequality and bound the last term from below by The next step in the proof of Theorem 1.6 is to find a convenient n-tuple N of points from (0, 1) d whose removal produces a set with sufficiently small convexity ratio. We are going to find N using a continuous version of the well-known Epsilon Net Theorem [9]. Before stating this result, we need some definitions.
Let X be a subset of R d and let U be a set system on X . We say that a set T ⊆ X is shattered by U if every subset of T can be obtained as the intersection of some U ∈ U with T . The Vapnik-Chervonenkis dimension (or VC-dimension) of U , denoted by dim(U ), is the maximum n (or ∞ if no such maximum exists) for which some subset of X of cardinality n is shattered by U .
Let U be a system of measurable subsets of a set X ⊆ R d with λ d (X ) = 1, and let ε ∈ (0, 1) be a real number. A set N ⊆ X is called an ε-net for (X, U ) if N ∩ U = ∅ for every U ∈ U with λ d (U ) ε. To apply Theorem 3.4, the VC-dimension of the set system U has to be finite. However, it is known that the VC-dimension of all convex sets in R d is infinite (see e.g. [13, p. 238]). Therefore, instead of considering convex sets directly, we approximate them by ellipsoids.
A d-dimensional ellipsoid in R d is an image of the closed d-dimensional unit ball under a nonsingular affine map. A convex body in R d is a compact convex subset of R d with non-empty interior. The following result, known as John's Lemma [10], shows that every convex body can be approximated by an inscribed ellipsoid.
In particular, we have λ d (K )/d d λ d (E).
As the last step before the proof of Theorem 1.6, we mention the following fact, which implies that the VC-dimension of the system E of d-dimensional ellipsoids in R d is at most d+2 d . Lemma 3.6 [ It is a natural question whether the bound for b d (S) in Theorem 1.6 can be improved to b d (S) = Ω(c(S)). In the plane, this is related to the famous problem of Danzer and Rogers (see [5,14] and Problem E14 in [7]) which asks whether for given ε > 0 there is a set N ⊆ (0, 1) 2 of size O( 1 ε ) with the property that every convex set of area ε within the unit square contains at least one point from N .
If this problem was to be answered affirmatively, then we could use such a set N to stab (0, 1) 2 in our proof of Theorem 1.6 which would yield the desired bound for b 2 (S). However it is generally believed that the answer is likely to be nonlinear in 1 ε .

Other Variants and Open Problems
We have seen in Theorem 1.3 that a p-componentwise simply connected set S ⊆ R 2 whose b(S) is defined satisfies b(S) α c(S), for an absolute constant α 180. Equivalently, such a set S satisfies smc(S) b(S)λ 2 (S)/180.
By a result of Blaschke [4] (see also Sas [18]), every convex set K ⊆ R 2 contains a triangle of measure at least 3 √ 3 4π λ 2 (K ). In view of this, Theorem 1.3 yields the following consequence.

Corollary 4.1
There is a constant α > 0 such that every p-componentwise simply connected set S ⊆ R 2 whose b(S) is defined contains a triangle T ⊆ S of measure at least α b(S)λ 2 (S).
A similar argument works in higher dimensions as well. For every d 2, there is a constant β = β(d) such that every convex set K ⊆ R d contains a simplex of measure at least βλ d (K ) (see e.g. Lassak [12]). Therefore, Theorem 1.5 can be rephrased in the following equivalent form. What can we say about sets S ⊆ R 2 that are not p-componentwise simply connected? First of all, we can consider a weaker form of simple connectivity: we call a set S p-componentwise simply -connected if for every triangle T such that ∂ T ⊆ S we have T ⊆ S. We conjecture that Theorem 1.3 can be extended to p-componentwise simply -connected sets.

Conjecture 4.3
There is an absolute constant α > 0 such that every p-componentwise simply -connected set S ⊆ R 2 whose b(S) is defined satisfies b(S) α c(S).
What does the value of b(S) say about a planar set S that does not satisfy even a weak form of simple connectivity? As Proposition 3.7 shows, such a set may not contain any convex subset of positive measure, even when b(S) is equal to 1. However, we conjecture that a large b(S) implies the existence of a large convex set whose boundary belongs to S.

Conjecture 4.4
For every ε > 0, there is a δ > 0 such that if S ⊆ R 2 is a set with b(S) ε, then there is a bounded convex set C ⊆ R 2 with λ(C) δλ(S) and ∂C ⊆ S. Theorem 1.3 shows that Conjecture 4.4 holds for p-componentwise simply connected sets, with δ being a constant multiple of ε. It is possible that even in the general setting of Conjecture 4.4, δ can be taken as a constant multiple of ε.
Motivated by Corollary 4.1, we propose a stronger version of Conjecture 4.4, where the convex set C is required to be a triangle.

Conjecture 4.5
For every ε > 0, there is a δ > 0 such that if S ⊆ R 2 is a set with b(S) ε, then there is a triangle T ⊆ R 2 with λ(T ) δλ(S) and ∂ T ⊆ S.
Note that Conjecture 4.5 holds when restricted to p-componentwise simply connected sets, as implied by Corollary 4.1.
We can generalize Conjecture 4.5 to higher dimensions and to higher-order indices of convexity. To state the general conjecture, we introduce the following notation: for a set X ⊆ R d , let X k be the set of k-element subsets of X , and let the set Skel k (X ) be defined by If X is the vertex set of a d-dimensional simplex T = Conv(X ), then Skel k (X ) is often called the k-dimensional skeleton of T . Our general conjecture states, roughly speaking, that sets with large k-index of convexity should contain the k-dimensional skeleton of a large simplex. Here is the precise statement.

Conjecture 4.6
For every k, d ∈ N such that 1 k d and every ε > 0, there is a δ > 0 such that if S ⊆ R d is a set with b k (S) ε, then there is a simplex T with vertex set X such that λ d (T ) δλ d (S) and Skel k (X ) ⊆ S. Corollary 4.2 asserts that this conjecture holds in the special case of k = d 2, since Skel d (X ) = Conv(X ) = T . Corollary 4.1 shows that the conjecture holds for k = 1 and d = 2 if S is further assumed to be p-componentwise simply connected. In all these cases, δ can be taken as a constant multiple of ε, with the constant depending on k and d.
Finally, we can ask whether there is a way to generalize Theorem 1.3 to higher dimensions, by replacing simple connectivity with another topological property. Here is an example of one such possible generalization. A modification of the proof of Theorem 1.5 implies that Conjecture 4.7 is true for star-shaped sets S.