Discrete & Computational Geometry

, Volume 57, Issue 1, pp 179–214 | Cite as

On the Beer Index of Convexity and Its Variants

  • Martin Balko
  • Vít Jelínek
  • Pavel Valtr
  • Bartosz Walczak
Open Access
Article
  • 470 Downloads

Abstract

Let S be a subset of \(\mathbb {R}^d\) with finite positive Lebesgue measure. The Beer index of convexity\({\text {b}}(S)\) of S is the probability that two points of S chosen uniformly independently at random see each other in S. The convexity ratio\({\text {c}}(S)\) 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\subseteq \mathbb {R}^2\) with simply connected components satisfies \({\text {b}}(S)\leqslant \alpha {\text {c}}(S)\) for an absolute constant \(\alpha \), provided \({\text {b}}(S)\) 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 \({\text {b}}(S)\). For \(1\leqslant k\leqslant d\), the k-index of convexity\({\text {b}}_k(S)\) of a set \(S\subseteq \mathbb {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\geqslant 2\) there is a constant \(\beta (d)>0\) such that every set \(S\subseteq \mathbb {R}^d\) satisfies \({\text {b}}_d(S)\leqslant \beta {\text {c}}(S)\), provided \({\text {b}}_d(S)\) exists. We provide an almost matching lower bound by showing that there is a constant \(\gamma (d)>0\) such that for every \(\varepsilon \in (0,1)\) there is a set \(S\subseteq \mathbb {R}^d\) of Lebesgue measure 1 satisfying \({\text {c}}(S)\leqslant \varepsilon \) and \({\text {b}}_d(S)\geqslant \gamma \frac{\varepsilon }{\log _2{1/\varepsilon }}\geqslant \gamma \frac{{\text {c}}(S)}{\log _2{1/{\text {c}}(S)}}\).

Keywords

Beer index of convexity Convexity ratio Convexity measure Visibility 

Mathematics Subject Classification

52A27 

1 Introduction

For positive integers k and d and a Lebesgue measurable set \(S\subseteq {\mathbb {R}}^d\), we use \(\lambda _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\subseteq {\mathbb {R}}^d\), let \({{\mathrm{smc}}}(S)\) denote the supremum of the measures of convex subsets of S. Since all convex subsets of \({\mathbb {R}}^d\) are measurable [11], the value of \({{\mathrm{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 \({{\mathrm{c}}}(S)\) be defined as \({{\mathrm{smc}}}(S)/\lambda _d(S)\). We call the parameter \({{\mathrm{c}}}(S)\) the convexity ratio of S.

For two points \(A,B \in {\mathbb {R}}^d\), let \({\overline{AB}}\) denote the closed line segment with endpoints A and B. Let S be a subset of \({\mathbb {R}}^d\). We say that points \(A,B \in S\) are visible one from the other or see each other in S if the line segment \({\overline{AB}}\) is contained in S. For a point \(A\in S\), we use \({{\mathrm{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 \({{\mathrm{Vis}}}(T,S)\) to denote the set of points that are visible in S from T. That is, \({{\mathrm{Vis}}}(T,S)\) is the set of points \(A\in S\) for which there is a point \(B\in T\) such that \({\overline{AB}}\subseteq S\).

Let \({{\mathrm{Seg}}}(S)\) denote the set \(\{(A,B)\in S\times S:{\overline{AB}}\subseteq S\}\subseteq ({\mathbb {R}}^d)^2\), which we call the segment set of S. For a set \(S\subseteq {\mathbb {R}}^d\) with finite positive measure and with measurable \({{\mathrm{Seg}}}(S)\), we define the parameter \({{\mathrm{b}}}(S)\in [0,1]\) by
$$\begin{aligned} {{\mathrm{b}}}(S):=\frac{\lambda _{2d}({{\mathrm{Seg}}}(S))}{\lambda _d(S)^2}. \end{aligned}$$
If S is not measurable, or if its measure is not positive and finite, or if \({{\mathrm{Seg}}}(S)\) is not measurable, we leave \({{\mathrm{b}}}(S)\) undefined. Note that if \({{\mathrm{b}}}(S)\) is defined for a set S, then \({{\mathrm{c}}}(S)\) is defined as well.

We call \({{\mathrm{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.

1.1 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 \(\lambda ({{\mathrm{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.

1.2 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 \(\partial S\), \({S}^\circ \), and \(\overline{S}\) denote the boundary, the interior, and the closure of a set S, respectively. For a point \(A\in {\mathbb {R}}^2\) and \(\varepsilon >0\), let \(\mathscr {N}_{\varepsilon }(A)\) denote the open disc centered at A with radius \(\varepsilon \). For a set \(X\subseteq {\mathbb {R}}^2\) and \(\varepsilon >0\), let \(\mathscr {N}_{\varepsilon }(X):=\bigcup _{A\in X}\mathscr {N}_{\varepsilon }(A)\). A neighborhood of a point \(A\in {\mathbb {R}}^2\) or a set \(X\subseteq {\mathbb {R}}^2\) is a set of the form \(\mathscr {N}_{\varepsilon }(A)\) or \(\mathscr {N}_{\varepsilon }(X)\), respectively, for some \(\varepsilon >0\).

A closed interval with endpoints a and b is denoted by [ab]. Intervals [ab] with \(a>b\) are considered empty. For a point \(A\in {\mathbb {R}}^2\), we use x(A) and y(A) to denote the x-coordinate and the y-coordinate of A, respectively.

A polygonal curve\(\varGamma \) in \({\mathbb {R}}^d\) is a curve specified by a sequence \((A_1,\ldots ,A_n)\) of points of \({\mathbb {R}}^d\) such that \(\varGamma \) consists of the line segments connecting the points \(A_i\) and \(A_{i+1}\) for \(i=1,\ldots ,n-1\). If \(A_1=A_n\), then the polygonal curve \(\varGamma \) is closed. A polygonal curve that is not closed is called a polygonal line.

A set \(X\subseteq {\mathbb {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 self-avoiding 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 \(\mathbb {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 \(\mathbb {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 \({\overline{AB}}\).

We say that a set \(S\subseteq {\mathbb {R}}^d\) is star-shaped if there is a point \(C\in S\) such that \({{\mathrm{Vis}}}(C,S)=S\). That is, a star-shaped set S contains a point which sees the entire S. Similarly, we say that a set S is weakly star-shaped if S contains a line segment \(\ell \) such that \({{\mathrm{Vis}}}(\ell ,S)=S\).

1.3 Results

We start with a few simple observations. Let S be a subset of \({\mathbb {R}}^2\) such that \({{\mathrm{Seg}}}(S)\) is measurable. For every \(\varepsilon >0\), S contains a convex subset K of measure at least \(({{\mathrm{c}}}(S)-\varepsilon )\lambda _2(S)\). Two points of S chosen uniformly independently at random both belong to K with probability at least \(({{\mathrm{c}}}(S)-\varepsilon )^2\), hence \({{\mathrm{b}}}(S)\geqslant ({{\mathrm{c}}}(S)-\varepsilon )^2\). This yields \({{\mathrm{b}}}(S)\geqslant {{\mathrm{c}}}(S)^2\). This simple lower bound on \({{\mathrm{b}}}(S)\) is tight, as shown by a set S which is a disjoint union of a single large convex component and a large number of small components of negligible size.

It is more challenging to find an upper bound on \({{\mathrm{b}}}(S)\) in terms of \({{\mathrm{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 \({{\mathrm{b}}}(S)={{\mathrm{c}}}(S)=\frac{1}{n}\). It is easy to modify this example to obtain, for any \(\varepsilon >0\), a simple star-shaped polygon P with \({{\mathrm{b}}}(P)\geqslant \frac{1}{n}-\varepsilon \) and \({{\mathrm{c}}}(P)\leqslant \frac{1}{n}\), see Fig. 1. This shows that \({{\mathrm{b}}}(S)\) cannot be bounded from above by a sublinear function of \({{\mathrm{c}}}(S)\), even for simple polygons S.
Fig. 1

A star-shaped polygon P with \({{\mathrm{b}}}(P)\geqslant \frac{1}{n}-\varepsilon \) and \({{\mathrm{c}}}(P)\leqslant \frac{1}{n}\). The polygon P is a union of n triangles \((0,0)(2i,1)(2i+1,1)\), \(i=0,\ldots ,n-1\), and of a triangle \((0,0)(0,\delta )((2n-1)\delta ,\delta )\), where \(\delta \) is very small

For weakly star-shaped polygons, Cabello et al. [6] showed that the above example is essentially optimal, providing the following linear upper bound on \({{\mathrm{b}}}(S)\).

Theorem 1.1

[6, Thm. 5] For every weakly star-shaped simple polygon P, we have \({{\mathrm{b}}}(P)\leqslant 18{{\mathrm{c}}}(P)\).

For polygons that are not weakly star-shaped, Cabello et al. [6] gave a superlinear bound.

Theorem 1.2

[6, Thm. 6] Every simple polygon P satisfies
$$\begin{aligned} {{\mathrm{b}}}(P)\leqslant 12{{\mathrm{c}}}(P)\Big (1+\log _2{\frac{1}{{{\mathrm{c}}}(P)}}\Big ). \end{aligned}$$

Moreover, Cabello et al. [6] conjectured that even for a general simple polygon P, \({{\mathrm{b}}}(P)\) can be bounded from above by a linear function of \({{\mathrm{c}}}(P)\). (The question whether \({{\mathrm{b}}}(P)=O({{\mathrm{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 \({{\mathrm{b}}}(S)\) is defined for a set S if and only if S has finite positive measure and \({{\mathrm{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\subseteq {\mathbb {R}}^2\) whose \({{\mathrm{b}}}(S)\) is defined satisfies \({{\mathrm{b}}}(S)\leqslant 180{{\mathrm{c}}}(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].

Corollary 1.4

Every simple polygon \(P\subseteq {\mathbb {R}}^2\) satisfies \({{\mathrm{b}}}(P)\leqslant 180{{\mathrm{c}}}(P)\).

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\smallsetminus {\mathbb {Q}}^2\), where it is easy to verify that \({{\mathrm{c}}}(S)=0\) and \({{\mathrm{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\smallsetminus {\mathbb {Q}}^2\), and define a set \(S'\subseteq {\mathbb {R}}^3\) by
$$\begin{aligned} S':=\{(tx,ty,t):t\in [0,1]\text { and }(x,y)\in S\}. \end{aligned}$$
Again, it is easy to verify that \({{\mathrm{c}}}(S')=0\) and \({{\mathrm{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\in \{1,\ldots ,d\}\) and a set \(S\subseteq {\mathbb {R}}^d\), we define the set \({{\mathrm{Simp}}}_k(S)\subseteq ({\mathbb {R}}^d)^{k+1}\) by
$$\begin{aligned} {{\mathrm{Simp}}}_k(S):=\{(A_0,\ldots ,A_k) \in S^{k+1} :{{\mathrm{Conv}}}(\{A_0,\ldots ,A_k\}) \subseteq S\}, \end{aligned}$$
where the operator \({{\mathrm{Conv}}}\) denotes the convex hull of a set of points. We call \({{\mathrm{Simp}}}_k(S)\) the k-simplex set of S. Note that \({{\mathrm{Simp}}}_1(S)={{\mathrm{Seg}}}(S)\).
For \(k\in \{1,\ldots ,d\}\) and a set \(S\subseteq {\mathbb {R}}^d\) with finite positive measure and with measurable \({{\mathrm{Simp}}}_k(S)\), we define \({{\mathrm{b}}}_k(S)\) by
$$\begin{aligned} {{\mathrm{b}}}_k(S):=\frac{\lambda _{(k+1)d}({{\mathrm{Simp}}}_k(S))}{\lambda _{d}(S)^{k+1}}. \end{aligned}$$
Note that \({{\mathrm{b}}}_1(S)={{\mathrm{b}}}(S)\). We call \({{\mathrm{b}}}_k(S)\) the k-index of convexity of S. We again leave \({{\mathrm{b}}}_k(S)\) undefined if S or \({{\mathrm{Simp}}}_k(S)\) is non-measurable, or if the measure of S is not finite and positive.

We can view \({{\mathrm{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\subseteq {\mathbb {R}}^d\), we have \({{\mathrm{b}}}_1(S)\geqslant {{\mathrm{b}}}_2(S)\geqslant \cdots \geqslant {{\mathrm{b}}}_d(S)\), provided all the \({{\mathrm{b}}}_k(S)\) are defined.

We remark that the set \(S:=[0,1]^d\smallsetminus {\mathbb {Q}}^d\) satisfies \({{\mathrm{c}}}(S)=0\) and \({{\mathrm{b}}}_1(S)={{\mathrm{b}}}_2(S)=\cdots ={{\mathrm{b}}}_{d-1}(S)=1\), see Proposition 3.7. Thus, for a general set \(S\subseteq {\mathbb {R}}^d\), only the d-index of convexity can conceivably admit a nontrivial upper bound in terms of \({{\mathrm{c}}}(S)\). Our next result shows that such an upper bound on \({{\mathrm{b}}}_d(S)\) exists and is linear in \({{\mathrm{c}}}(S)\).

Theorem 1.5

For every \(d \geqslant 2\), there is a constant \(\beta =\beta (d)>0\) such that every set \(S\subseteq {\mathbb {R}}^d\) with \({{\mathrm{b}}}_d(S)\) defined satisfies \({{\mathrm{b}}}_{d}(S)\leqslant \beta {{\mathrm{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.

Theorem 1.6

For every \(d\geqslant 2\), there is a constant \(\gamma =\gamma (d)>0\) such that for every \(\varepsilon \in (0,1)\), there is a set \(S\subseteq {\mathbb {R}}^d\) satisfying \({{\mathrm{c}}}(S)\leqslant \varepsilon \) and \({{\mathrm{b}}}_{d}(S)\geqslant \gamma \frac{\varepsilon }{\log _2 1/\varepsilon }\), and in particular, we have \({{\mathrm{b}}}_{d}(S)\geqslant \gamma \frac{{{\mathrm{c}}}(S)}{\log _2 1/{{\mathrm{c}}}(S)}\).

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.

2 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 \(\alpha >0\) be a constant such that every bounded open simply connected set \(T\subseteq {\mathbb {R}}^2\) satisfies \({{\mathrm{b}}}(T)\leqslant \alpha {{\mathrm{c}}}(T)\). It follows that every p-componentwise simply connected set \(S\subseteq {\mathbb {R}}^2\) with \({{\mathrm{b}}}(S)\) defined satisfies \({{\mathrm{b}}}(S)\leqslant \alpha {{\mathrm{c}}}(S)\).

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 \({{\mathrm{b}}}(S'')\) can be arbitrarily close to \({{\mathrm{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 \({{\mathrm{b}}}(S)=O({{\mathrm{c}}}(S))\). This is equivalent to a bound of the form \(\lambda _4({{\mathrm{Seg}}}(S))=O({{\mathrm{smc}}}(S)\lambda _2(S))\). We therefore need a suitable upper bound on \(\lambda _4({{\mathrm{Seg}}}(S))\).

We first choose in S a diagonal\(\ell \) (i.e., an inclusion-maximal line segment in S), and show that the set \(S\smallsetminus \ell \) 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 \(\ell \) contribute to \(\lambda _4({{\mathrm{Seg}}}(S))\) by at most \(O({{\mathrm{smc}}}(S)\lambda _2(S))\) (Lemma 2.8). Our main task is to bound the measure of \({{\mathrm{Seg}}}(S_i\cup \ell )\) for \(i=1,2\). The two sets \(S_i\cup \ell \) 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\subseteq \partial S'\), called the root.

To bound \(\lambda _4({{\mathrm{Seg}}}(R))\) for a rooted set R with root r, we partition R into levels\(L_1,L_2,\ldots \), 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\cup L_{i+1}\) for some \(i\geqslant 1\). Thus, a bound of the form \(\lambda _4({{\mathrm{Seg}}}(L_i\cup L_{i+1}))=O({{\mathrm{smc}}}(R)\lambda _2(L_i\cup L_{i+1}))\) implies the required bound for \(\lambda _4({{\mathrm{Seg}}}(R))\).

We will show that each p-component of \(L_i\cup 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\in R\) a set \(\mathfrak {T}(A)\) of measure \(O({{\mathrm{smc}}}(R))\), such that for every \((A,B)\in {{\mathrm{Seg}}}(R)\), we have either \(B\in \mathfrak {T}(A)\) or \(A\in \mathfrak {T}(B)\) (Lemma 2.7). From this, Theorem 1.3 will follow easily.

2.1 Proof of Theorem 1.3 for Bounded Open Simply Connected Sets

First, we need a few auxiliary lemmas.

Lemma 2.2

For every positive integer d, if S is an open subset of \({\mathbb {R}}^d\), then the set \({{\mathrm{Seg}}}(S)\) is open and the set \({{\mathrm{Vis}}}(A,S)\) is open for every point \(A\in S\).

Proof

Choose a pair of points \((A,B)\in {{\mathrm{Seg}}}(S)\). Since S is open and \({\overline{AB}}\) is compact, there is \(\varepsilon >0\) such that \(\mathscr {N}_{\varepsilon }(\overline{AB})\subseteq S\). Consequently, for any \(A'\in \mathscr {N}_{\varepsilon }(A)\) and \(B'\in \mathscr {N}_{\varepsilon }(B)\), we have \(\overline{A'B'}\subseteq S\), that is, \((A',B')\in {{\mathrm{Seg}}}(S)\). This shows that the set \({{\mathrm{Seg}}}(S)\) is open. If we fix \(A'=A\), then it follows that the set \({{\mathrm{Vis}}}(A,S)\) is open. \(\square \)

Lemma 2.3

Let S be a simply connected subset of \({\mathbb {R}}^2\) and let \(\ell \) and \(\ell '\) be line segments in S. It follows that the set \({{\mathrm{Vis}}}(\ell ',S)\cap \ell \) is a (possibly empty) subsegment of \(\ell \).

Proof

The statement is trivially true if \(\ell \) and \(\ell '\) intersect or have the same supporting line, or if \({{\mathrm{Vis}}}(\ell ',S)\cap \ell \) is empty. Suppose that these situations do not occur. Let \(A,B\in \ell \) and \(A',B'\in \ell '\) be such that \(\overline{AA'},\overline{BB'}\subseteq 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 \({\overline{AB}}\subseteq {{\mathrm{Vis}}}(\ell ',S)\). Otherwise, \(\overline{AA'}\) and \(\overline{BB'}\) have a point D in common, and every point \(C\in AB\) is visible in R from the point \(C'\in A'B'\) such that \(D\in \overline{CC'}\). This shows that \({{\mathrm{Vis}}}(\ell ',S)\cap \ell \) is a convex subset and hence a subsegment of \(\ell \). \(\square \)

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\subseteq {\mathbb {R}}^2\) is half-open if every point \(A\in S\) has a neighborhood \(\mathscr {N}_{\varepsilon }(A)\) that satisfies one of the following two conditions:
  1. 1.

    \(\mathscr {N}_{\varepsilon }(A)\subseteq S\),

     
  2. 2.

    \(\mathscr {N}_{\varepsilon }(A)\cap \partial S\) is a diameter of \(\mathscr {N}_{\varepsilon }(A)\) splitting it into two subsets, one of which (including the diameter) is \(\mathscr {N}_{\varepsilon }(A)\cap S\) and the other (excluding the diameter) is \(\mathscr {N}_{\varepsilon }(A)\smallsetminus S\).

     
The condition 1 holds for points \(A\in {S}^\circ \), while the condition 2 holds for points \(A\in \partial S\).
A set \(R\subseteq {\mathbb {R}}^2\) is a rooted set if the following conditions are satisfied:
  1. 1.

    R is bounded,

     
  2. 2.

    R is p-connected and simply connected,

     
  3. 3.

    R is half-open,

     
  4. 4.

    \(R\cap \partial R\) is an open line segment.

     
The open line segment \(R\cap \partial R\) is called the root of R. Every rooted set, as the union of a non-empty open set and an open line segment, is measurable and has positive measure.

A diagonal of a set \(S\subseteq {\mathbb {R}}^2\) is a line segment contained in S that is not a proper subset of any other line segment contained in S. Clearly, if S is open, then every diagonal of S is an open line segment. It is easy to see that the root of a rooted set R is a diagonal of R.

The following lemma allows us to use a diagonal to split a bounded open simply connected subset of \({\mathbb {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 \({\mathbb {R}}^2\), and let \(\ell \) be a diagonal of S. It follows that the set \(S\smallsetminus \ell \) has two p-components \(S_1\) and \(S_2\). Moreover, \(S_1\cup \ell \) and \(S_2\cup \ell \) are rooted sets, and \(\ell \) 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 \(L_1={{\mathrm{Vis}}}(r,R)\), where r denotes the root of R. A k-body of R is a p-component of \(L_k\). A body of R is a k-body of R for some k. See 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\subseteq {\mathbb {R}}^2\smallsetminus P\) if the root of P is subset of the interior of \(P\cup 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\geqslant 1}\) be its partition into levels. It follows that
  1. 1.

    \(R=\bigcup _{k\geqslant 1}L_k\); consequently, R is the union of all its bodies;

     
  2. 2.

    every body P of R is a rooted set such that \(P={{\mathrm{Vis}}}(r,P)\), where r denotes the root of P;

     
  3. 3.

    \(L_1\) is the unique 1-body of R, and the root of \(L_1\) is the root of R;

     
  4. 4.

    every j-body P of R with \(j\geqslant 2\) is attached to a unique \((j-1)\)-body of R.

     
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\geqslant 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.
Fig. 2

Example of a rooted set R partitioned into six bodies. The three levels of R are distinguished with three shades of gray. The segment \(A'B'\cup \{B'\}\) is the base segment of \({\overline{AB}}\)

Lemma 2.6

Let R be a rooted set, \((L_k)_{k\geqslant 1}\) be the partition of R into levels, \(\ell \) be a closed line segment in R, and \(k\geqslant 1\) be minimum such that \(\ell \cap L_k\ne \emptyset \). It follows that \(\ell \subseteq L_k\cup L_{k+1}\), \(\ell \cap L_k\) is a subsegment of \(\ell \) contained in a single k-body P of R, and \(\ell \cap L_{k+1}\) consists of at most two subsegments of \(\ell \) each contained in a single \((k+1)\)-body whose parent body is P.

Proof

The definition of the levels directly yields \(\ell \subseteq L_k\cup L_{k+1}\). The segment \(\ell \) 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 parent-child relation of the body tree. This implies that \(\ell \cap L_k\) lies within a single k-body P. By Lemma 2.3, \(\ell \cap L_k\) is a subsegment of \(\ell \). Consequently, \(\ell \cap L_{k+1}\) consists of at most two subsegments. \(\square \)

In the setting of Lemma 2.6, we call the subsegment \(\ell \cap L_k\) of \(\ell \) the base segment of \(\ell \), and we call the body P that contains \(\ell \cap L_k\) the base body of \(\ell \). 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\in R\) can be assigned a measurable set \(\mathfrak {T}(A)\subseteq {\mathbb {R}}^2\) so that the following is satisfied:
  1. 1.

    \(\lambda _2(\mathfrak {T}(A))<87{{\mathrm{smc}}}(R)\);

     
  2. 2.

    for every line segment \(\overline{BC}\) in R, we have either \(B\in \mathfrak {T}(C)\) or \(C\in \mathfrak {T}(B)\);

     
  3. 3.

    the set \(\{(A,B):A\in R\) and \(B\in \mathfrak {T}(A)\}\) is measurable.

     

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\in r:\exists \varepsilon >0:\mathscr {N}_{\varepsilon }(D)\cap h^-=\mathscr {N}_{\varepsilon }(D)\cap (P\smallsetminus r)\}\) and \(\{D\in r:\exists \varepsilon >0:\mathscr {N}_{\varepsilon }(D)\cap h^+=\mathscr {N}_{\varepsilon }(D)\cap (P\smallsetminus r)\}\) are open and partition the entire r, hence one of them must be empty. This implies that the segments connecting r to \(P\smallsetminus r\) lie all in \(h^-\) or all in \(h^+\). Since \(P={{\mathrm{Vis}}}(r,P)\), we conclude that \(P\subseteq h^-\) or \(P\subseteq 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\in {\mathbb {R}}^2:y(B)\geqslant 0\}\). For a point \(A\in R\), we use d(Ar) to denote the y-coordinate of A after such a rotation and translation of R. We use d(A) to denote d(Ar) where r is the root of the body of A. It follows that \(d(A)\geqslant 0\) for every \(A\in R\).

Let \(\gamma \in (0,1)\) be a fixed constant whose value will be specified at the end of the proof. For a point \(A\in R\), we define sets
$$\begin{aligned} \begin{aligned} \mathfrak {V}_1(A)&:=\{B\in {{\mathrm{Vis}}}(A,R):|A'B'|\geqslant \gamma |AB|,\, A\in {{\mathrm{Vis}}}(r'',R),\, d(A',r'')\geqslant d(B',r'')\},\\ \mathfrak {V}_2(A)&:=\{B\in {{\mathrm{Vis}}}(A,R):|A'B'|\geqslant \gamma |AB|,\, A\notin {{\mathrm{Vis}}}(r'',R),\, d(A',r'')\geqslant d(B',r'')\},\\ \mathfrak {V}_3(A)&:=\{B\in {{\mathrm{Vis}}}(A,R):|A'B'|<\gamma |AB|,\, |AA'|\geqslant |BB'|\}, \end{aligned} \end{aligned}$$
where \(r''\) denotes the root of the base body of \({\overline{AB}}\) and \(A'\) and \(B'\) denote the endpoints of the base segment of \({\overline{AB}}\) such that \(|AA'|<|AB'|\). For every \(A \in R\), the sets \(\mathfrak {V}_1(A)\), \(\mathfrak {V}_2(A)\), and \(\mathfrak {V}_3(A)\) are pairwise disjoint. Moreover, we have \(A\in \bigcup _{i=1}^3\mathfrak {V}_i(B)\) or \(B\in \bigcup _{i=1}^3\mathfrak {V}_i(A)\) for every line segment \({\overline{AB}}\) in R. If for some \(B\in \bigcup _{i=1}^3\mathfrak {V}_i(A)\) the point A lies on \(r''\), then we have \(B\in \mathfrak {V}_1(A)\) and \(\mathfrak {V}_1(A)\subseteq r''\).

For the rest of the proof, we fix a point \(A\in R\). We show that the union \(\bigcup _{i=1}^3\mathfrak {V}_i(A)\) is contained in a measurable set \(\mathfrak {T}(A)\subseteq {\mathbb {R}}^2\) with \(\lambda _2(\mathfrak {T}(A))<87{{\mathrm{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\geqslant 2\), then we use \(r'\) to denote the root of the parent body of P.

Claim 1

\(\mathfrak {V}_1(A)\) is contained in a trapezoid \(\mathfrak {T}_1(A)\) with area \(6\gamma ^{-2}{{\mathrm{smc}}}(R)\).

Let H be a point of r such that \(\overline{AH}\subseteq R\). Let \(T'\) be the r-parallel trapezoid of height d(A) with bases of length \(\frac{8{{\mathrm{smc}}}(R)}{d(A)}\) and \(\frac{4{{\mathrm{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 \(\gamma ^{-1}\) transforms \(T'\) into the trapezoid \(T:= A+\gamma ^{-1}(T'-A)\). Since the area of \(T'\) is \(6{{\mathrm{smc}}}(R)\), the area of T is \(6\gamma ^{-2}{{\mathrm{smc}}}(R)\). We show that \(\mathfrak {V}_1(A)\subseteq T\). See Fig. 3 for an illustration.
Fig. 3

Illustration for the proof of Claim 1 in the proof of Lemma 2.7

Let B be a point in \(\mathfrak {V}_1(A)\). Using a similar approach to the one used by Cabello et al. [6] in the proof of Theorem 1.1, we show that \(B\in T\). Let \(A'B'\) be the base segment of \({\overline{AB}}\) such that \(|AA'|<|AB'|\). Since \(B\in \mathfrak {V}_1(A)\), we have \(|A'B'|\geqslant \gamma |AB|\), \(A\in {{\mathrm{Vis}}}(r'',R)\), and \(d(B,r'')\leqslant d(A,r'')\), where \(r''\) denotes the root of the base level of \({\overline{AB}}\). Since A is visible from \(r''\) in R, the base body of \({\overline{AB}}\) is the body of A and thus \(A=A'\) and \(r=r''\). As we have observed, every point \(C\in \{A\}\cup AB'\) satisfies \(d(C,r)=d(C)\geqslant 0\).

Let \(\varepsilon >0\). There is a point \(E\in AB'\) such that \(|B'E|<\varepsilon \). Since E lies on the base segment of \({\overline{AB}}\), there is \(F\in r\) such that \(\overline{EF}\subseteq R\). It is possible to choose F so that \(\overline{AH}\) and \(\overline{EF}\) have a point C in common where \(C\ne F,H\). Let D be a point of \(\overline{AH}\) with \(d(D)=d(E)\). The point D exists, as \(d(H)=0\leqslant d(E)\leqslant d(A)\). The points AEFH 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 ACE and CFH have area at most \({{\mathrm{smc}}}(R)\).

The triangle ACE is partitioned into triangles ADE and CDE with areas \(\frac{1}{2}(d(A)-d(D))|DE|\) and \(\frac{1}{2}(d(D)-d(C))|DE|\), respectively. Therefore, we have \(\frac{1}{2}(d(A)-d(C))|DE|=\lambda _2(ACE)\leqslant {{\mathrm{smc}}}(R)\). This implies
$$\begin{aligned} |DE|\leqslant \frac{2{{\mathrm{smc}}}(R)}{d(A)-d(C)}. \end{aligned}$$
For the triangle CFH, we have \(\frac{1}{2}d(C)|FH|=\lambda _2(CFH)\leqslant {{\mathrm{smc}}}(R)\). By the similarity of the triangles CFH and CDE, we have \(|FH|=|DE|d(C)/(d(E)-d(C))\) and therefore
$$\begin{aligned} |DE|\leqslant \frac{2{{\mathrm{smc}}}(R)}{d(C)^2}(d(E)-d(C)). \end{aligned}$$
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 \(d(C)=d(A)d(E)/(d(A)+d(E))\). Then we obtain \(|DE|\leqslant \frac{2{{\mathrm{smc}}}(R)}{d(A)^2}(d(A)+d(E))\). This and \(0\leqslant d(E)\leqslant d(A)\) imply \(E\in T'\). Since \(\varepsilon \) can be made arbitrarily small and \(T'\) is compact, we have \(B'\in T'\). Since \(|AB'|\geqslant \gamma |AB|\), we conclude that \(B\in T\). This completes the proof of Claim 1.

Claim 2

\(\mathfrak {V}_2(A)\) is contained in a trapezoid \(\mathfrak {T}_2(A)\) with area \(3(1-\gamma )^{-2}\gamma ^{-2}{{\mathrm{smc}}}(R)\).

We assume the point A is not contained in the first level of R, as otherwise \(\mathfrak {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'\subseteq p^+\) and \(A\notin q^+\). Let O be the intersection point of p and q.

Let \(T'\subseteq p^+\cap q^+\) be the trapezoid of height \(d(A,r')\) with one base of length \(\frac{4{{\mathrm{smc}}}(R)}{(1-\gamma )^2d(A,r')}\) on p, the other base of length \(\frac{2{{\mathrm{smc}}}(R)}{(1-\gamma )^2d(A,r')}\) on the supporting line of \(r'\), and one lateral side on q. The homothety with center O and ratio \(\gamma ^{-1}\) transforms \(T'\) into the trapezoid \(T:= O+\gamma ^{-1}(T'-O)\). Since the area of \(T'\) is \(3(1-\gamma )^{-2}{{\mathrm{smc}}}(R)\), the area of T is \(3(1-\gamma )^{-2}\gamma ^{-2}{{\mathrm{smc}}}(R)\). We show that \(\mathfrak {V}_2(A)\subseteq T\). See Fig. 4 for an illustration.
Fig. 4

Illustration for the proof of Claim 2 in the proof of Lemma 2.7

Let B be a point of \(\mathfrak {V}_2(A)\). We use \(A'B'\) to denote the base segment of \({\overline{AB}}\) such that \(|AA'|<|AB'|\). By the definition of \(\mathfrak {V}_2(A)\), we have \(|A'B'|\geqslant \gamma |AB|\), \(A\notin {{\mathrm{Vis}}}(r'',R)\), and \(d(B,r'')\leqslant d(A,r'')\), where \(r''\) denotes the root of the base body of \({\overline{AB}}\). By Lemma 2.6 and the fact that \(A\notin {{\mathrm{Vis}}}(r'',R)\), we have \(r'=r''\). The bound \(d(A,r')\geqslant d(B,r')\) thus implies \(A'\in r\cap p^+\) and \(B\in q^+\). We have \(d(C,r')=d(C)\geqslant 0\) for every \(C\in A'B'\).

Observe that \((1-\gamma )d(A,r')\leqslant d(A',r')\leqslant d(A,r')\). The upper bound is trivial, as \(d(B,r')\leqslant d(A,r')\) and \(A'\) lies on \({\overline{AB}}\). For the lower bound, we use the expression \(A'=tA+(1-t)B'\) for some \(t\in [0,1]\). This gives us \(d(A',r')=td(A,r')+(1-t)d(B',r')\). By the estimate \(|A'B'|\geqslant \gamma |AB|\), we have
$$\begin{aligned} |AA'|+|BB'| \leqslant (1-\gamma )|AB| = (1-\gamma )(|AB'|+|BB'|). \end{aligned}$$
This can be rewritten as \(|AA'|\leqslant (1-\gamma )|AB'|-\gamma |BB'|\). Consequently, \(|BB'|\geqslant 0\) and \(\gamma >0\) imply \(|AA'|\leqslant (1-\gamma )|AB'|\). This implies \(t\geqslant 1-\gamma \). Applying the bound \(d(B',r') \geqslant 0\), we conclude that \(d(A',r')\geqslant (1-\gamma )d(A,r')\).

Let \((G_n)_{n\in {\mathbb {N}}}\) be a sequence of points from \(A'B'\) that converges to \(A'\). For every \(n\in {\mathbb {N}}\), there is a point \(H_n\in r'\) such that \(\overline{G_nH_n}\subseteq R\). Since \(\overline{r'}\) is compact, there is a subsequence of \((H_n)_{n\in {\mathbb {N}}}\) that converges to a point \(H_0\in \overline{r'}\). We claim that \(H_0\in q\). Suppose otherwise, and let \(q'\ne q\) be the supporting line of \(\overline{A'H_0}\). Let \(\varepsilon >0\) be small enough so that \(\mathscr {N}_{\varepsilon }(A')\subseteq R\). For n large enough, \(\overline{G_nH_n}\) is contained in an arbitrarily small neighborhood of \(q'\). Consequently, for n large enough, the supporting line of \(\overline{G_nH_n}\) intersects q at a point \(K_n\) such that \(\overline{G_nK_n}\subseteq \mathscr {N}_{\varepsilon }(A')\), which implies \(K_n\in r\cap {{\mathrm{Vis}}}(r',R)\), a contradiction.

Again, let \(\varepsilon >0\). There is a point \(E\in A'B'\) such that \(|B'E|<\varepsilon \). Let \(D'\) be a point of q with \(d(D',r')=d(E)\), and let \(\delta >0\). There are points \(G\in A'B'\) and \(H\in r'\) such that \(G\in \mathscr {N}_{\delta }(A')\) and \(\overline{GH}\subseteq R\cap \mathscr {N}_{\delta }(q)\). If \(\delta \) is small enough, then \(d(E)\leqslant d(A',r')-\delta \leqslant d(G)\leqslant d(A',r')\). Let D be the point of \(\overline{GH}\) with \(d(D)=d(E)\). The point E lies on \(A'B'\) and thus it is visible from a point \(F\in r'\). Again, we can choose F so that the line segments \(\overline{EF}\) and \(\overline{GH}\) have a point C in common where \(C\ne F,H\). The points EFHG 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 CEG and CFH is at most \({{\mathrm{smc}}}(R)\).

The argument used in the proof of Claim 1 yields
$$\begin{aligned} |DE|\leqslant \frac{2{{\mathrm{smc}}}(R)}{d(G)^2}(d(G)+d(E))\leqslant \frac{2{{\mathrm{smc}}}(R)}{(d(A',r')-\delta )^2}(d(A',r')+d(E)). \end{aligned}$$
This and the fact that \(\delta \) (and consequently \(|D'D|\)) can be made arbitrarily small yield \(|D'E|\leqslant \frac{2{{\mathrm{smc}}}(R)}{d(A',r')^2}(d(A',r')+d(E))\). This together with \(d(A',r')\geqslant (1-\gamma )d(A,r')\) yield \(|D'E|\leqslant \frac{2{{\mathrm{smc}}}(R)}{(1-\gamma )^2d(A,r')^2}(d(A,r')+d(E))\). Finally, from \(0\leqslant d(E)\leqslant d(A,r')\) it follows that \(E\in T'\).

Since \(\varepsilon \) can be made arbitrarily small and \(T'\) is compact, we have \(B'\in T'\). Since \(|A'B'|\geqslant \gamma |AB|\geqslant \gamma |A'B|\), we conclude that \(B\in T\). This completes the proof of Claim 2.

Claim 3

\(\mathfrak {V}_3(A)\) is contained in a trapezoid \(\mathfrak {T}_3(A)\) with area \((4(1-\gamma )^{-2}-1){{\mathrm{smc}}}(R)\).

By Lemma 2.3, the points of r that are visible from A in R form a subsegment CD of r. The homothety with center A and ratio \(2(1-\gamma )^{-1}\) transforms the triangle \(T':= ACD\) into the triangle \(T'':= A+2(1-\gamma )^{-1}(T'-A)\). See Fig. 5 for an illustration. We claim that \(\mathfrak {V}_3(A)\) is a subset of the trapezoid \(T:= T''\smallsetminus T'\).

Let B be an arbitrary point of \(\mathfrak {V}_3(A)\). Consider the segment \({\overline{AB}}\) with the base segment \(A'B'\) such that \(|AA'|<|AB'|\). Since \(B\in \mathfrak {V}_3(A)\), we have \(|A'B'|<\gamma |AB|\) and \(|AA'|\geqslant |BB'|\). This implies \(|AA'|\geqslant \frac{1-\gamma }{2}|AB|>0\) and hence \(A\ne A'\) and \(B\notin P\). From the definition of C and D, we have \(A'\in {\overline{CD}}\). Since \(|AA'|\geqslant \frac{1-\gamma }{2}|AB|\) and \(B\notin P\), we have \(B\in T\).

The area of T is \((4(1-\gamma )^{-2}-1)\lambda _2(T')\). The interior of \(T'\) is contained in R, as all points of the open segment CD are visible from A in R. The area of \(T'\) is at most \({{\mathrm{smc}}}(R)\), as its interior is a convex subset of R. Consequently, the area of T is at most \((4(1-\gamma )^{-2}-1){{\mathrm{smc}}}(R)\). This completes the proof of Claim 3.
Fig. 5

Illustration for the proof of Claim 3 in the proof of Lemma 2.7

To put everything together, we set \(\mathfrak {T}(A):=\bigcup _{i=1}^3\mathfrak {T}_i(A)\). Then, it follows that \(\bigcup _{i=1}^3\mathfrak {V}_i(A)\subseteq \mathfrak {T}(A)\) for every \(A\in R\). Clearly, the set \(\mathfrak {T}(A)\) is measurable. Summing the three estimates on areas of the trapezoids, we obtain
$$\begin{aligned} \lambda _2(\mathfrak {T}(A)) \leqslant \bigl (6\gamma ^{-2} + 3(1-\gamma )^{-2}\gamma ^{-2} + 4(1-\gamma )^{-2} - 1\bigr ){{\mathrm{smc}}}(R) \end{aligned}$$
for every point \(A\in R\). We choose \(\gamma \in (0,1)\) so that the value of the coefficient is minimized. For \(x\in (0,1)\), the function \(x\mapsto 6x^{-2}+3(1-x)^{-2}x^{-2}+4(1-x)^{-2}-1\) attains its minimum \(86.7027<87\) at \(x\approx 0.5186\). Altogether, we have \(\lambda _2(\mathfrak {T}(A)) < 87{{\mathrm{smc}}}(R)\) for every \(A\in R\).

It remains to show that the set \(\{(A,B):A\in R\) and \(B\in \mathfrak {T}(A)\}\) is measurable. For every body P of R and for \(i\in \{1,2,3\}\), the definition of the trapezoid \(\mathfrak {T}_i(A)\) in Claim i implies that the set \(\{(A,B):A\in P\) and \(B\in \mathfrak {T}_i(A)\}\) is the intersection of \(P\times {\mathbb {R}}^2\) with a semialgebraic (hence measurable) subset of \(({\mathbb {R}}^2)^2\) and hence is measurable. There are countably many bodies of R, as each of them has positive measure. Therefore, \(\{(A,B):A\in R\) and \(B\in \mathfrak {T}(A)\}\) is a countable union of measurable sets and hence is measurable. \(\square \)

Let S be a bounded open subset of the plane, and let \(\ell \) be a diagonal of S that lies on the x-axis. For a point \(A\in S\), we define the set
$$\begin{aligned} \mathfrak {S}(A,\ell ):=\{B\in {{\mathrm{Vis}}}(A,S):AB\cap \ell \ne \emptyset \text { and } |y(A)| \geqslant |y(B)|\}. \end{aligned}$$
The following lemma is a slightly more general version of a result of Cabello et al. [6].

Lemma 2.8

Let S be a bounded open simply connected subset of \({\mathbb {R}}^2\), and let \(\ell \) be its diagonal. It follows that\(\lambda _2(\mathfrak {S}(A,\ell ))\leqslant 3{{\mathrm{smc}}}(S)\) for every \(A\in S\).

Proof

We can assume without loss of generality that \(\ell \) lies on the x-axis. Using an argument similar to the proof of Lemma 2.2, we can show that the set \(\{B \in {{\mathrm{Vis}}}(A,S) :AB \cap \ell \ne \emptyset \}\) is open. Therefore, \(\mathfrak {S}(A,\ell )\) is the intersection of an open set and the closed half-plane \(\{(x,y)\in {\mathbb {R}}^2:y\leqslant -y(A)\}\) or \(\{(x,y)\in {\mathbb {R}}^2:y\geqslant -y(A)\}\), whichever contains A. Consequently, the set \(\mathfrak {S}(A,\ell )\) is measurable for every \(A\in S\).

We clearly have \(\lambda _2(\mathfrak {S}(A,\ell ))=0\) for points \(A\in S\smallsetminus {{\mathrm{Vis}}}(\ell ,S)\). By Lemma 2.3, the set \({{\mathrm{Vis}}}(A,S)\cap \ell \) is an open subsegment CD of \(\ell \). The interior \({T}^\circ \) of the triangle \(T:= ACD\) is contained in S. Since \({T}^\circ \) is a convex subset of S, we have \(\lambda _2({T}^\circ )=\frac{1}{2}|CD|\cdot |y(A)|\leqslant {{\mathrm{smc}}}(S)\). Therefore, every point \(B\in \mathfrak {S}(A,\ell )\) is contained in a trapezoid of height |y(A)| with bases of length |CD| and 2|CD|. The area of this trapezoid is \(\frac{3}{2}|CD|\cdot |y(A)|\leqslant 3{{\mathrm{smc}}}(S)\). Hence we have \(\lambda _2(\mathfrak {S}(A,\ell ))\leqslant 3{{\mathrm{smc}}}(S)\) for every point \(A\in S\). \(\square \)

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 \(\ell \) be a diagonal of S. We can assume without loss of generality that \(\ell \) lies on the x-axis.

According to Lemma 2.4, the set \(S\smallsetminus \ell \) has exactly two p-components \(S_1\) and \(S_2\), the sets \(S_1\cup \ell \) and \(S_2\cup \ell \) are rooted sets, and \(\ell \) is their common root. By Lemma 2.7, for \(i\in \{1,2\}\), every point \(A\in S_i\cup \ell \) can be assigned a measurable set \(\mathfrak {T}_i(A)\) so that \(\lambda _2(\mathfrak {T}_i(A)) < 87{{\mathrm{smc}}}(S_i\cup \ell ) \leqslant 87{{\mathrm{smc}}}(S)\), every line segment \(\overline{BC}\) in \(S_i\cup \ell \) satisfies \(B\in \mathfrak {T}_i(C)\) or \(C\in \mathfrak {T}_i(B)\), and the set \(\{(A,B):A\in S_i\cup \ell \) and \(B\in \mathfrak {T}_i(A)\}\) is measurable.

We set \(\mathfrak {S}(A):=\mathfrak {T}_i(A)\cup \mathfrak {S}(A,\ell )\) for every point \(A\in S_i\) with \(i\in \{1,2\}\). We set \(\mathfrak {S}(A):=\mathfrak {T}_1(A)\cup \mathfrak {T}_2(A)\) for every point \(A\in \ell =S\smallsetminus ( S_1\cup S_2)\). Let
$$\begin{aligned} \mathfrak {S}:=\{(A,B):A\in S\text { and }B\in \mathfrak {S}(A)\} \cup \{(B,A):A\in S\text { and }B\in \mathfrak {S}(A)\} \subseteq ({\mathbb {R}}^2)^2. \end{aligned}$$
It follows that the set \(\mathfrak {S}\) is measurable.
Let \({\overline{AB}}\) be a line segment in S, and suppose \(|y(A)|\geqslant |y(B)|\). Then either A and B are in distinct p-components of \(S\smallsetminus \ell \) or they both lie in the same component \(S_i\) with \(i\in \{1,2\}\). In the first case, we have \(B\in \mathfrak {S}(A)\), since AB intersects \(\ell \) and \(\mathfrak {S}(A,\ell )\subseteq \mathfrak {S}(A)\). In the second case, we have \(B\in \mathfrak {T}_i(A)\subseteq \mathfrak {S}(A)\) or \(A\in \mathfrak {T}_i(B)\subseteq \mathfrak {S}(B)\). Therefore, we have \({{\mathrm{Seg}}}(S)\subseteq \mathfrak {S}\). Since both \({{\mathrm{Seg}}}(S)\) and \(\mathfrak {S}\) are measurable, we have
$$\begin{aligned} \lambda _4({{\mathrm{Seg}}}(S)) \leqslant \lambda _4(\mathfrak {S}) \leqslant 2\int _{A\in S}\lambda _2(\mathfrak {S}(A)), \end{aligned}$$
where the second inequality is implied by Fubini’s Theorem. The bound \(\lambda _2(\mathfrak {S}(A))\leqslant 90{{\mathrm{smc}}}(S)\) implies
$$\begin{aligned} \lambda _4({{\mathrm{Seg}}}(S)) \leqslant 2\int _S 90{{\mathrm{smc}}}(S) = 180{{\mathrm{smc}}}(S)\lambda _2(S). \end{aligned}$$
Finally, this bound can be rewritten as \({{\mathrm{b}}}(S) = \lambda _4({{\mathrm{Seg}}}(S))\lambda _2(S)^{-2} \leqslant 180{{\mathrm{c}}}(S)\). \(\square \)

2.2 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 \({\mathbb {R}}^2\).

Lemma 2.9

Let \(S\subseteq {\mathbb {R}}^2\) be a set whose \({{\mathrm{b}}}(S)\) is defined. For every \(\varepsilon >0\), there is a bounded set \(S'\subseteq S\) such that \(\lambda (S')\geqslant (1-\varepsilon )\lambda (S)\) and \({{\mathrm{b}}}(S')\geqslant {{\mathrm{b}}}(S)-\varepsilon \). Moreover, if S is p-componentwise simply connected, then so is \(S'\).

Proof

Let B be an open ball in \({\mathbb {R}}^2\) centered at the origin. Consider the sets \(S'=S\cap B\) and \(S_0=S\smallsetminus B\) partitioning the set S. Fix the radius of B large enough, so that \(S_0\) has measure at most \(\varepsilon \lambda (S)/2\). We claim that \(S'\) has the properties stated in the lemma.

Clearly \(\lambda (S')\geqslant (1-\varepsilon /2)\lambda (S)>(1-\varepsilon )\lambda (S)\). Moreover, \({{\mathrm{Seg}}}(S')={{\mathrm{Seg}}}(S)\smallsetminus \big ((S_0\times S)\cup (S\times S_0)\big )\), and hence \({{\mathrm{Seg}}}(S')\) is measurable and we have \(\lambda _4({{\mathrm{Seg}}}(S'))\geqslant \lambda _4({{\mathrm{Seg}}}(S))-\varepsilon \lambda (S)^2\). Therefore,
$$\begin{aligned} {{\mathrm{b}}}(S') = \frac{\lambda _4({{\mathrm{Seg}}}(S'))}{\lambda _4(S'\times S')} \geqslant \frac{\lambda _4({{\mathrm{Seg}}}(S'))}{\lambda _4(S\times S)} \geqslant \frac{\lambda _4({{\mathrm{Seg}}}(S))-\varepsilon \lambda (S)^2}{\lambda _4(S\times S)} = {{\mathrm{b}}}(S)-\varepsilon , \end{aligned}$$
as claimed. It is clear from the construction that if S is p-componentwise simply connected, then so is \(S'\). \(\square \)

Lemma 2.10

Let \(S\subseteq {\mathbb {R}}^2\) be a bounded p-componentwise simply connected measurable set with measurable segment set. Then \(\lambda _4({{\mathrm{Seg}}}(S)\smallsetminus {{\mathrm{Seg}}}({S}^\circ ))=0\). In other words, all the segments in S are in fact contained in \({S}^\circ \), except for a set of measure zero.

Proof

Let \(\mathfrak {B}\) denote the set \({{\mathrm{Seg}}}(S)\smallsetminus {{\mathrm{Seg}}}({S}^\circ )\), that is, \(\mathfrak {B}\) is the set of segments in S containing at least one point of \(\partial S\). Note that \(\mathfrak {B}\) is measurable, since \({{\mathrm{Seg}}}(S)\) is measurable by assumption and \({{\mathrm{Seg}}}({S}^\circ )\) is an open set by Lemma 2.2, hence it is measurable as well.

Let \({\overline{AB}}\) be a segment contained in S, and let C be a point of \({\overline{AB}}\). We say that C is an isolated boundary point of the segment \({\overline{AB}}\), if \(C\in \partial S\), but there is an \(\varepsilon >0\) such that no other point of \({\overline{AB}}\cap \mathscr {N}_{\varepsilon }(C)\) belongs to \(\partial S\).

We partition the set \(\mathfrak {B}\) into four parts as follows:
$$\begin{aligned} \mathfrak {B}_|&:=\{(A,B)\in \mathfrak {B}:A=B\text { or }{\overline{AB}}\text { is a vertical segment}\},\\ \mathfrak {B}_{\lhd }&:=\{(A,B)\in \mathfrak {B}\smallsetminus \mathfrak {B}_|:A\text { is an isolated boundary point of }{\overline{AB}}\},\\ \mathfrak {B}_{\rhd }&:=\{(A,B)\in \mathfrak {B}\smallsetminus (\mathfrak {B}_|\cup {\mathfrak {B}_{\lhd }}):B\text { is an isolated boundary point of }{\overline{AB}}\},\\ \mathfrak {B}_{\bullet }&:=\mathfrak {B}\smallsetminus (\mathfrak {B}_|\cup {\mathfrak {B}_{\lhd }}\cup {\mathfrak {B}_{\rhd }}). \end{aligned}$$
We claim that each of these sets has measure zero. For \(\mathfrak {B}_|\), this is clear, since \(\mathfrak {B}_|\) is a subset of \(\{(A,B)\in {\mathbb {R}}^2\times {\mathbb {R}}^2:A=B\text { or }{\overline{AB}}\text { is a vertical segment}\}\), which clearly has \(\lambda _4\)-measure zero.
Consider now the set \(\mathfrak {B}_{\lhd }\). We first argue that it is measurable. For a set \(\alpha \subseteq [0,1]\) and a pair of points (AB), define \({\overline{AB}}[\alpha ]:=\{tB+(1-t)A:t\in \alpha \}\), and let \(\mathfrak {S}(\alpha )\) be the set \(\{(A,B)\in {\mathbb {R}}^2\times {\mathbb {R}}^2:{\overline{AB}}[\alpha ]\subseteq {S}^\circ \}\). In particular, if \(\alpha =[0,1]\) then \({\overline{AB}}[\alpha ]={\overline{AB}}\) and \(\mathfrak {S}(\alpha )={{\mathrm{Seg}}}({S}^\circ )\). If \(\alpha \) is a closed interval, then \({\overline{AB}}[\alpha ]\) is a segment, and it is not hard to see that \(\mathfrak {S}(\alpha )\) is an open set, and, in particular, it is measurable. If \(\alpha \) is an open interval, say \(\alpha =(s,t)\subseteq [0,1]\), then \(\mathfrak {S}(\alpha )=\bigcap _{n\in {\mathbb {N}}}\mathfrak {S}([s+n^{-1},t-n^{-1}])\), and hence \(\mathfrak {S}(\alpha )\) is measurable as well. We then see that
$$\begin{aligned} \mathfrak {B}_{\lhd }=\mathfrak {B}\cap (\partial {S}\times S)\cap \Big (\bigcup _{n\in {\mathbb {N}}}\mathfrak {S}((0,n^{-1}))\Big ), \end{aligned}$$
showing that \(\mathfrak {B}_{\lhd }\) is measurable. An analogous argument shows that \(\mathfrak {B}_{\rhd }\) is measurable, and hence \(\mathfrak {B}_{\bullet }\) is measurable as well.

In the rest of the proof, we will use two basic facts of integral calculus, which we now state explicitly.

Fact 1

(see [17, Lem. 7.25 and Thm. 7.26]) Let \(X,Y\subseteq {\mathbb {R}}^d\) be two open sets, and let \(\sigma :X\rightarrow Y\) be a bijection such that both \(\sigma \) and \(\sigma ^{-1}\) are continuous and differentiable on X and Y, respectively. Then, for any \(X_0\subseteq X\), the set \(X_0\) is measurable if and only if \(\sigma (X_0)\) is measurable. Moreover, \(\lambda (X_0)=0\) if and only if \(\lambda (\sigma (X_0))=0\).

Fact 2

(Fubini’s Theorem, see [17, Thm. 8.12]) Let \(M\subseteq {\mathbb {R}}^k\times {\mathbb {R}}^\ell \) be a measurable set. For \(x\in {\mathbb {R}}^k\), define \(M_x:=\{y\in {\mathbb {R}}^\ell :(x,y)\in M\}\). Then, for almost every \(x\in {\mathbb {R}}^k\), the set \(M_x\) is \(\lambda _\ell \)-measurable, and
$$\begin{aligned} \lambda _{k+\ell }(M)=\int _{x\in {\mathbb {R}}^k} \lambda _{\ell }(M_x). \end{aligned}$$

Let us prove that \(\lambda _4(\mathfrak {B}_{\lhd })=0\). The basic idea is as follows: suppose that we have fixed a non-vertical line L and a point \(B\in L\). It can be easily seen that there are at most countably many points \(A\in L\) such that \((A,B)\in {\mathfrak {B}_{\lhd }}\). Since a line L with a point \(B\in L\) can be determined by three parameters, we will see that \(\mathfrak {B}_{\lhd }\) has \(\lambda _4\)-measure zero.

Let us describe this reasoning more rigorously. Let \(L_{a,b}\) denote the line \(\{(x,y)\in {\mathbb {R}}^2:y=ax+b\}\). Define a mapping \(\sigma :{\mathbb {R}}^4\rightarrow {\mathbb {R}}^2\times {\mathbb {R}}^2\) as follows: \(\sigma (a,b,x,x')=(A,B)\), where \(A=(x,ax+b)\) and \(B=(x',ax'+b)\). In other words, \(\sigma (a,b,x,x')\) is the pair of points on the line \(L_{a,b}\) whose horizontal coordinates are x and \(x'\), respectively. For every non-vertical segment \({\overline{AB}}\), there is a unique quadruple \((a,b,x,x')\) with \(x\ne x'\), such that \(\sigma (a,b,x,x')=(A,B)\). In particular, \(\sigma \) is a bijection from the set \(\{(a,b,x,x')\in {\mathbb {R}}^4:x\ne x'\}\) to the set \(\{(A,B)\in {\mathbb {R}}^{2}\times {\mathbb {R}}^{2}:A,B \text { not on the same vertical line}\}\).

Define \({\widehat{\mathfrak {B}_{\lhd }}}=\sigma ^{-1}(\mathfrak {B}_{\lhd })\). Note that \(\sigma \) satisfies the assumptions of Fact 1, and therefore \({\widehat{\mathfrak {B}_{\lhd }}}\) is measurable. Moreover, \(\lambda _4({\widehat{\mathfrak {B}_{\lhd }}})=0\) if and only if \(\lambda _4(\mathfrak {B}_{\lhd })=0\).

For a fixed triple \((a,b,x')\in {\mathbb {R}}^3\), let \(X_{a,b,x'}\) denote the set \(\{x\in {\mathbb {R}}:(a,b,x,x')\in {\widehat{\mathfrak {B}_{\lhd }}}\}\). We claim that \(X_{a,b,x'}\) is countable. To see this, choose a point \(x\in X_{a,b,x'}\) and define \((A,B):=\sigma (a,b,x,x')\). Since \((A,B)\in \mathfrak {B}_{\lhd }\), we know that A is an isolated boundary point of \({\overline{AB}}\), which implies that there is a closed interval \(\beta \subseteq {\mathbb {R}}\) of positive length such that \(\beta \cap X_{a,b,x'}=\{x\}\). This implies that \(X_{a,b,x'}\) is countable and thus of measure zero.

Since \({\widehat{\mathfrak {B}_{\lhd }}}\) is measurable, we can apply Fubini’s Theorem to get
$$\begin{aligned} \lambda _4(\widehat{\mathfrak {B}_{\lhd }})=\int _{(a,b,x')\in {\mathbb {R}}^3}\lambda _1(X_{a,b,x'}). \end{aligned}$$
Therefore \(\lambda _4(\widehat{\mathfrak {B}_{\lhd }})=0\) as claimed. A similar argument shows that \(\lambda _4(\widehat{\mathfrak {B}_{\rhd }})=0\).

It remains to deal with the set \(\mathfrak {B}_{\bullet }\). 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 \(\mathfrak {B}_{\bullet }\).

Let \(L'_{a,b}\) denote the (non-horizontal) line \(\{(ay+b,y):y\in {\mathbb {R}}\}\). Let us say that a pair of distinct points (AB) has type (a, b, c), if \(A\in L'_{a,b}\), \(B \in L'_{a,c}\), and the segment \({\overline{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 (AB) defining a non-vertical segment has a unique type (abc), with \(b\ne c\). Define a mapping \(\tau :{\mathbb {R}}^4\rightarrow {\mathbb {R}}^2\times {\mathbb {R}}^2\), where \(\tau (a,b,c,y)\) is the pair of points (AB) of type (abc) such that \(A=(ay+b,y)\). Note that \(\tau \) is a bijection from the set \(\{(a,b,c,y)\in {\mathbb {R}}^4:b\ne c\}\) to the set \(\{(A,B)\in {\mathbb {R}}^2\times {\mathbb {R}}^2:A,B \text { not on the same vertical line}\}\). We can easily verify that \(\tau \) satisfies the assumptions of Fact 1.

Define \({\widetilde{\mathfrak {B}_{\bullet }}}=\tau ^{-1}(\mathfrak {B}_{\bullet })\). From Fact 1, it follows that \(\widetilde{\mathfrak {B}_{\bullet }}\) is measurable, and \(\lambda _4(\mathfrak {B}_{\bullet })=0\) if and only if \(\lambda _4(\widetilde{\mathfrak {B}_{\bullet }})=0\). For a type \(t=(a,b,c)\in {\mathbb {R}}^3\), define \(Y_t=\{y\in {\mathbb {R}}:(a,b,c,y)\in \widetilde{\mathfrak {B}_{\bullet }}\}\). Furthermore, for a set \(\alpha \subseteq [0,1]\), define \(\mathfrak {B}_{\bullet }(\alpha )=\mathfrak {B}_{\bullet }\cap \mathfrak {S}(\alpha )\), \(\widetilde{\mathfrak {B}_{\bullet }}(\alpha )=\tau ^{-1}(\mathfrak {B}_{\bullet }(\alpha ))\), and \(Y_t(\alpha )=\{y\in {\mathbb {R}}:(a,b,c,y)\in \widetilde{\mathfrak {B}_{\bullet }}(\alpha )\}\). In our applications, \(\alpha \) will always be an interval (in fact, an open interval with rational endpoints), and in such case we already know that \(\mathfrak {B}_{\bullet }(\alpha )\) is measurable, hence \(\widetilde{\mathfrak {B}_{\bullet }}(\alpha )\) is measurable.

By Fubini’s Theorem, we have
$$\begin{aligned} \lambda _4(\widetilde{\mathfrak {B}_{\bullet }})=\int _{a\in {\mathbb {R}}}\int _{(b,c)\in {\mathbb {R}}^2}\lambda _1(Y_{(a,b,c)}), \end{aligned}$$
(*)
and \(Y_t\) is measurable for all \(t\in {\mathbb {R}}^3\) up to a set of \(\lambda _3\)-measure zero. An analogous formula holds for \(\widetilde{\mathfrak {B}_{\bullet }}(\alpha )\) and \(Y_t(\alpha )\) for any open interval \(\alpha \subseteq [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\subseteq {\mathbb {R}}^3\) of measure zero, such that for all \(t\in {\mathbb {R}}^3\smallsetminus T_0\) the set \(Y_t\) is measurable, and moreover for any rational interval \(\alpha \) the set \(Y_t(\alpha )\) is measurable as well.

Our goal is to show that there are at most countably many slopes \(a\in {\mathbb {R}}\) for which there is a \((b,c)\in {\mathbb {R}}^2\) such that \(\lambda _1(Y_{(a,b,c)})>0\). From (*) it will then follow that \(\widetilde{\lambda }_4(\mathfrak {B}_{\bullet })=0\). To achieve this goal, we will show that to any type t for which \(\lambda _1(Y_t)>0\), we can assign a set \(R_t\subseteq \partial S\) of positive \(\lambda _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)\in {\mathbb {R}}^3\smallsetminus T_0\) such that \(\lambda _1(Y_t)>0\). Let us say that an element \(y\in Y_t\) is half-isolated if there is an \(\varepsilon >0\) such that \([y,y+\varepsilon ]\cap Y_t=\{y\}\) or \([y-\varepsilon ,y]\cap Y_t=\{y\}\). Clearly, \(Y_t\) has at most countably many half-isolated elements. Define \(Y_t^*:=\{y\in Y_t:y\) is not half-isolated\(\}\). Of course, \(\lambda _1(Y_t^*)=\lambda _1(Y_t)\). See Fig. 6 for an illustration.
Fig. 6

An illustration for the proof of Lemma 2.10. The element \(y_1\) of \(Y_t\) is half-isolated while \(y_2\) is not

Choose \(y\in Y_t^*\), and define \((A_y,B_y):=\tau (a,b,c,y)\). We claim that \(\overline{A_yB_y}\cap {S}^\circ \) is either empty or a single interval. Let us choose any two points \(C,D\in \overline{A_yB_y}\cap {S}^\circ \). We will show that the segment \({\overline{CD}}\) is inside \({S}^\circ \). For \(\varepsilon >0\) small enough, the neighborhoods \(\mathscr {N}_{\varepsilon }(C)\) and \(\mathscr {N}_{\varepsilon }(D)\) are subsets of S. Since y is not half-isolated in \(Y_t\), we can find two segments \(P,Q\in \mathfrak {B}_{\bullet }\) of type t that intersect both \(\mathscr {N}_{\varepsilon }(C)\) and \(\mathscr {N}_{\varepsilon }(D)\), with \(\overline{A_yB_y}\) being between P and Q. We can then find a closed polygonal curve \(\varGamma \subseteq P\cup Q\cup \mathscr {N}_{\varepsilon }(C)\cup \mathscr {N}_{\varepsilon }(D)\) whose interior region contains \({\overline{CD}}\). Since S is p-componentwise simply connected, we see that \({\overline{CD}}\subseteq {S}^\circ \). Therefore, \(\overline{A_yB_y}\cap {S}^\circ \) is indeed an interval.

Since \(\partial S\) is a closed set, we know that for every \(y\in Y_t^*\), the set \(\overline{A_yB_y}\cap \partial S\) is closed as well. Moreover, neither \(A_y\) nor \(B_y\) are isolated boundary points of \(\overline{A_yB_y}\), because then \((A_y,B_y)\) would belong to \(\mathfrak {B}_{\lhd }\) or \(\mathfrak {B}_{\rhd }\). We conclude that \(\overline{A_yB_y}\cap \partial 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\in {\mathbb {N}}\), define two sets \(Y_t^{\lhd }(n)\) and \(Y_t^{\rhd }(n)\) by
$$\begin{aligned} Y_t^{\lhd }(n)&:=\{y\in Y_t^*:\overline{A_yB_y}[(0,n^{-1})]\subseteq \partial S\}\text { and }\\ Y_t^{\rhd }(n)&:=\{y\in Y_t^*:\overline{A_yB_y}[(1-n^{-1},1)]\subseteq \partial S\}. \end{aligned}$$
Note that these sets are measurable: for instance, \(Y_t^{\lhd }(n)\) is equal to \(Y_t^*\smallsetminus \big (\bigcup _\alpha Y_t(\alpha )\big )\), where we take the union over all rational intervals \(\alpha \) intersecting \((0,n^{-1})\). Moreover, we have \(Y_t^*=\bigcup _{n\in {\mathbb {N}}}(Y_t^{\lhd }(n)\cup Y_t^{\rhd }(n))\). It follows that there is an n such that \(Y_t^{\lhd }(n)\) or \(Y_t^{\rhd }(n)\) has positive measure. Fix such an n and assume, without loss of generality, that \(\lambda _1(Y_t^{\lhd }(n))\) is positive. Define the region of t, denoted by \(R_t\), by
$$\begin{aligned} R_t:=\bigcup _{y\in Y_t^{\lhd }(n)}\overline{A_yB_y}\big [(0,n^{-1})\big ]. \end{aligned}$$
The set \(R_t\) is a bijective affine image of \(Y_t^{\lhd }(n)\times (0,n^{-1})\), and in particular it is \(\lambda _2\)-measurable with positive measure. Note that \(R_t\) is a subset of \(\partial S\).

Consider now two types \(t,t'\in {\mathbb {R}}^3\smallsetminus 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\in R_t\cap R_{t'}\). Let \({\overline{AB}}\) and \(\overline{A'B'}\) be the segments containing C and having types t and \(t'\), respectively. Fix \(\varepsilon >0\) small enough, so that none of the four endpoints \(A,B,A',B'\) lies in \(\mathscr {N}_{\varepsilon }(C)\). Since \(Y_t^*\) has no half-isolated points of \(Y_t\), we know that \(\mathfrak {B}_{\bullet }\) has segments of type t arbitrarily close to \({\overline{AB}}\) on both sides of \({\overline{AB}}\), and similarly for segments of type \(t'\) close to \(\overline{A'B'}\). We can therefore find four segments \(P,Q,P',Q'\in \mathfrak {B}_{\bullet }\smallsetminus \{{\overline{AB}},{\overline{A'B'}}\}\) with these properties:
  • P and Q have type t, and \(P'\) and \(Q'\) have type \(t'\).

  • \({\overline{AB}}\) is between P and Q (i.e., \({\overline{AB}}\subseteq {{\mathrm{Conv}}}(P\cup Q)\)) and \(\overline{A'B'}\) is between \(P'\) and \(Q'\).

  • Both P and Q intersect both \(P'\) and \(Q'\) inside \(\mathscr {N}_{\varepsilon }(C)\).

We see that the four points where \(P\cup Q\) intersects \(P'\cup 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}^\circ \). This is a contradiction, since all points of \(R_t\) (and \(R_{t'}\)) belong to \(\partial S\).

We conclude that \(R_t\) and \(R_{t'}\) are indeed disjoint. Since there cannot be uncountably many disjoint sets of positive measure in \({\mathbb {R}}^2\), there are at most countably many values \(a\in {\mathbb {R}}\) for which there is a type \(t=(a,b,c)\) with \(\lambda _1(Y_t)\) positive. Consequently, the right-hand side of (*) is zero, and so \(\lambda _4(\mathfrak {B}_{\bullet })=0\), as claimed. \(\square \)

Proof of Lemma 2.1

Observe that the inequalities \({{\mathrm{b}}}(S)\leqslant \alpha {{\mathrm{c}}}(S)\) and \(\lambda _4({{\mathrm{Seg}}}(S))\leqslant \alpha {{\mathrm{smc}}}(S)\lambda _2(S)\) are equivalent. Call a set Sbad if \({{\mathrm{Seg}}}(S)\) is measurable and \({{\mathrm{b}}}(S)>\alpha {{\mathrm{c}}}(S)\) or equivalently \(\lambda _4({{\mathrm{Seg}}}(S))>\alpha {{\mathrm{smc}}}(S)\lambda _2(S)\). To prove the lemma, we suppose for the sake of contradiction that there exists a bad p-componentwise simply connected set \(S\subseteq {\mathbb {R}}^2\) of finite positive measure.

By Lemma 2.9, for each \(\varepsilon >0\), there is a bounded p-componentwise simply connected set \(S'\subseteq S\) such that \(\lambda _2(S')\geqslant (1-\varepsilon )\lambda _2(S)\) and \({{\mathrm{b}}}(S')\geqslant {{\mathrm{b}}}(S)-\varepsilon \). In particular, such a set \(S'\) satisfies \({{\mathrm{c}}}(S')\leqslant {{\mathrm{c}}}(S)/(1-\varepsilon )\). Hence, for \(\varepsilon \) small enough, the set \(S'\) is bad.

Let \(S''\) be the interior of \(S'\). By Lemma 2.10, \(\lambda _4({{\mathrm{Seg}}}(S''))=\lambda _4({{\mathrm{Seg}}}(S'))\). Clearly, \(\lambda _2(S'')\leqslant \lambda _2(S')\) and \({{\mathrm{smc}}}(S'')\leqslant {{\mathrm{smc}}}(S')\), and therefore \(S''\) is bad as well.

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 \(\mathscr {C}\) be the set of p-components of \(S''\). Each \(T\in \mathscr {C}\) is a bounded open simply connected set, and therefore cannot be bad. Therefore,
$$\begin{aligned} \lambda _4({{\mathrm{Seg}}}(S''))=\sum _{T\in \mathscr {C}}\lambda _4({{\mathrm{Seg}}}(T))\leqslant \sum _{T\in \mathscr {C}}\alpha {{\mathrm{smc}}}(T)\lambda _2(T)\leqslant \alpha {{\mathrm{smc}}}(S'')\lambda _2(S''), \end{aligned}$$
showing that \(S''\) is not bad. This is a contradiction. \(\square \)

2.3 Proof of Lemma 2.4

Here we prove Lemma 2.4, which says that every bounded open simply connected subset of \({\mathbb {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 \({\mathbb {R}}^2\), and let \(\ell \) be a diagonal of S. Let \(h^-\) and \(h^+\) be the open half-planes defined by the supporting line of \(\ell \). It follows that the set \(S\smallsetminus \ell \) has exactly two p-components \(S_1\) and \(S_2\). Moreover, for every point \(A\in \ell \) and every neighborhood \(\mathscr {N}_{\varepsilon }(A)\subseteq S\), we have \(\mathscr {N}_{\varepsilon }(A)\cap h^-\subseteq S_1\) and \(\mathscr {N}_{\varepsilon }(A)\cap h^+\subseteq S_2\).

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\in \ell \), and let \(\mathscr {N}_{\varepsilon }(A)\) be a neighborhood of A contained in S. We choose arbitrary points \(B\in \mathscr {N}_{\varepsilon }(A)\cap h^-\) and \(C\in \mathscr {N}_{\varepsilon }(A)\cap h^+\). Suppose for a contradiction that \(S\smallsetminus \ell \) has a single p-component. Then there exists a polygonal curve \(\varGamma \) in \(S\smallsetminus \ell \) with endpoints B and C. Let \(\Delta \subseteq S\) be the closed polygonal curve \(\varGamma \cup \overline{BC}\). We can assume that the curve \(\Delta \) is simple using a local redrawing argument. See Fig. 7.
Fig. 7

Removing self-intersections and intersections between adjacent polygonal lines

The curve \(\Delta \) separates \({\mathbb {R}}^2\) into two regions. The closure \(\overline{\ell }\) of the diagonal \(\ell \) is a closed line segment that intersects \(\Delta \) in exactly one point. It follows that one endpoint of \(\ell \) is in the interior region of \(\Delta \). Since the endpoints of \(\ell \) do not belong to S, this contradicts the assumption that S is simply connected.

Now, we show that the set \(S\smallsetminus \ell \) has at most two p-components. For a point \(D\in \ell \), let \(\mathscr {N}_{\varepsilon }(D)\) be a neighborhood of D in S. The set \(\mathscr {N}_{\varepsilon }(D) \cap h^-\) is contained in a unique p-component \(S_1\) of \(S\smallsetminus \ell \), and \(\mathscr {N}_{\varepsilon }(D)\cap h^+\) is contained in a different p-component \(S_2\). Choose another point \(E\in \ell \) with a neighborhood \(\mathscr {N}_{\varepsilon '}(E)\subseteq S\). We claim that \(\mathscr {N}_{\varepsilon '}(E)\cap h^-\) also belongs to \(S_1\). To see this, note that since \(\overline{DE}\) is a compact subset of the open set S, it has a neighborhood \(\mathscr {N}_{\delta }(\overline{DE})\) which is contained in S. Clearly, \(\mathscr {N}_{\delta }(\overline{DE})\cap h^-\) is p-connected and therefore belongs to \(S_1\), hence \(\mathscr {N}_{\varepsilon '}(E)\cap 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\smallsetminus \ell \), there is a point \(A\in \ell \) and a neighborhood \(\mathscr {N}_{\varepsilon }(A)\subseteq S\) such that \(\mathscr {N}_{\varepsilon }(A)\cap S'\ne \emptyset \), we see that \(S_1\) and \(S_2\) are the only two p-components of \(S\smallsetminus \ell \). \(\square \)

Proof of Lemma 2.4

By Lemma 2.11, the set \(S\smallsetminus \ell \) has of exactly two p-components \(S_1\) and \(S_2\). It remains to show that \(S_1\cup \ell \) and \(S_2\cup \ell \) are rooted sets.

Since \(S_1\) and \(S_2\) are p-connected, \(S_1\cup \ell \) and \(S_2\cup \ell \) are p-connected as well. To show that \(S_1\cup \ell \) and \(S_2\cup \ell \) are simply connected, choose a Jordan curve \(\varGamma \) in, say, \(S_1\cup \ell \), and let Z be the interior region of \(\varGamma \). Suppose for a contradiction that Z is not a subset of \(S_1\cup \ell \). Since S is simply connected, we have \(Z\subseteq S\). Hence there is a point \(A\in Z\cap S_2\). Since both \(S_2\) and Z are open, we can assume that A does not lie on the supporting line of \(\ell \). Let \({\overline{AB}}\) be the minimal closed segment parallel to \(\ell \) such that \(B\in \varGamma \). Then B belongs to \(S_1\), A belongs to \(S_2\), and yet A and B are in the same p-component of \(S\smallsetminus \ell \). This contradiction shows that \(S_1\cup \ell \) and \(S_2\cup \ell \) are simply connected.

As subsets of the bounded set S, the sets \(S_1\cup \ell \) and \(S_2\cup \ell \) are bounded. Lemma 2.11 and the fact that \(S_i\) is open imply that the set \(S_i\cup \ell \) is half-open and \(S_i\cap \partial S_i=\ell \) for \(i\in \{1,2\}\). Therefore, the sets \(S_1\cup \ell \) and \(S_2\cup \ell \) are rooted, and \(\ell \) is their root. \(\square \)

2.4 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\geqslant 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\subseteq {\mathbb {R}}^2\), we say that the set S is T-half-open if every point \(A\in S\) has a neighborhood \(\mathscr {N}_{\varepsilon }(A)\) that satisfies one of the following two conditions:
  1. 1.

    \(\mathscr {N}_{\varepsilon }(A)\subseteq S\),

     
  2. 2.

    \(\mathscr {N}_{\varepsilon }(A)\cap \partial S\) is a diameter of \(\mathscr {N}_{\varepsilon }(A)\) splitting it into two subsets, one of which (including the diameter) is \(\mathscr {N}_{\varepsilon }(A)\cap S\) and the other (excluding the diameter) is \(\mathscr {N}_{\varepsilon }(A)\cap T\).

     
The only difference with the definition of S being half-open is that we additionally specify the “other side” of the neighborhoods \(\mathscr {N}_{\varepsilon }(A)\) for points \(A\in S\cap \partial S\) in the condition 2. A rooted set R is T-half-open if and only if it is attached to T according to the definition of attachment from Sect. 2.

Lemma 2.12

The set \(L_1\) is \(({\mathbb {R}}^2\smallsetminus R)\)-half-open and \(L_1\cap \partial L_1=R\cap \partial R\).

Proof

We consider two cases for a point \(A\in L_1\). First, suppose \(A\in L_1\cap \partial R\). It follows that A has a neighborhood \(\mathscr {N}_{\varepsilon }(A)\) that satisfies the condition 2 of the definition of a half-open set. By the definition of \(L_1\), the same neighborhood \(\mathscr {N}_{\varepsilon }(A)\) satisfies the condition 2 for \(L_1\) being an \(({\mathbb {R}}^2\smallsetminus R)\)-half-open set. In particular, \(A\in \partial L_1\). Since \(R\cap \partial R\subseteq L_1\) by the definition of \(L_1\), we have \(R\cap \partial R\subseteq L_1\cap \partial L_1\).

Now, suppose \(A\in L_1\cap {R}^\circ \). Let B be a point of the root of R such that \({\overline{AB}}\subseteq R\). We have \({\overline{AB}}\smallsetminus \{B\}\subseteq {R}^\circ \), as otherwise the point \(t'A+(1-t')B\) for \(t':=\sup \{t\in [0,1]:At+(1-t)B\in {\overline{AB}}\cap \partial R\}\) would contradict the fact that R is half-open. There is a family of neighborhoods \(\{\mathscr {N}_{\varepsilon _C}(C)\}_{C\in {\overline{AB}}}\) such that all \(\mathscr {N}_{\varepsilon _D}(D)\) with \(D\in {\overline{AB}}\smallsetminus \{B\}\) satisfy the condition 1 and \(\mathscr {N}_{\varepsilon _B}(B)\) satisfies the condition 2 for R being half-open. Since \({\overline{AB}}\) is compact, there is a finite set \(X\subseteq \overline{AB}\) such that \({\overline{AB}}\subseteq \bigcup _{C\in X}\mathscr {N}_{\varepsilon _C/2}(C)\). Hence \(\mathscr {N}_{\varepsilon }(\overline{AB})\subseteq \bigcup _{C\in X}\mathscr {N}_{\varepsilon _C}(C)\), where \(\varepsilon :=\min _{C\in X}\varepsilon _C/2\). It follows that \(\mathscr {N}_{\varepsilon }(\overline{AB})\cap \partial R\) is an open segment Q containing B but not A and splitting \(\mathscr {N}_{\varepsilon }(\overline{AB})\) into two subsets, one of which (including Q) is \(\mathscr {N}_{\varepsilon }(\overline{AB})\cap R\) and the other (excluding Q) is \(\mathscr {N}_{\varepsilon }(\overline{AB})\smallsetminus R\). Let \(\varepsilon '\) be the minimum of \(\varepsilon \) and the distance of A to the line containing Q. It follows that \(\mathscr {N}_{\varepsilon '}(A)\subseteq \mathscr {N}_{\varepsilon }(\overline{AB})\cap R\). Therefore, for every \(A'\in \mathscr {N}_{\varepsilon '}(A)\), we have \(\overline{A'B}\subseteq R\), hence \(\mathscr {N}_{\varepsilon '}(A)\subseteq L_1\). It also follows that \(L_1\cap \partial L_1\subseteq R\cap \partial R\). \(\square \)

We say that a set \(P\subseteq R\) is R-convex when the following holds for any two points \(A,B\in P\): if \({\overline{AB}}\subseteq R\), then \({\overline{AB}}\subseteq P\).

Lemma 2.13

The set \(L_1\) is R-convex.

Proof

This follows directly from Lemma 2.3. \(\square \)

A branch of R is a p-component of \(\bigcup _{k\geqslant 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\in P\) be such that \({\overline{AB}}\subseteq R\). Since R is half-open, it follows that \({\overline{AB}}\subseteq {R}^\circ \). Suppose \({\overline{AB}}\not \subseteq P\). It follows that \({\overline{AB}}\cap L_1\ne \emptyset \). Since \(L_1\) is \(({\mathbb {R}}^2\smallsetminus R)\)-half-open (Lemma 2.12) and R-convex (Lemma 2.13), we see that \({\overline{AB}}\cap L_1\) is an open segment \(A'B'\) for some \(A',B'\in {\overline{AB}}\). It follows that \(A',B'\in P\).

There is a simple polygonal line in P connecting \(A'\) with \(B'\), which together with \(\overline{A'B'}\) forms a Jordan curve \(\varGamma \) in R. Now, let \(C\in A'B'\). Since \(C\in L_1\), there is a point D on the root of R such that \({\overline{CD}}\subseteq R\). Since \(A',B'\notin L_1\), D does not lie on the supporting line of \(A'B'\). Extend the segment DC beyond C until hitting \(\partial R\) at a point \(C'\). Here we use the fact that R is bounded. Since R is simply connected, the entire interior region of \(\varGamma \) is contained in R, so the points D and \(C'\) both lie in the exterior region of \(\varGamma \). However, since \(\varGamma \cap L_1=A'B'\), the line segment \(\overline{DC'}\) crosses \(\varGamma \) at exactly one point, which is C. This is a contradiction. \(\square \)

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 \(\varGamma \) be a Jordan curve in P, A be a point in the interior region of \(\varGamma \), and BC be an inclusion-maximal open line segment in the interior region of \(\varGamma \) such that \(A\in BC\). It follows that \(B,C\in \varGamma \) and \(\overline{BC}\subseteq R\), as R is simply connected. Since \(B,C\in P\) and P is R-convex (Lemmas 2.13 and 2.14), we have \(A\in P\). \(\square \)

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 \(\partial P\cap P\). Let \(A\in \partial P\cap P\). Since R is half-open, A has a neighborhood \(\mathscr {N}_{\varepsilon }(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 \(\mathscr {N}_{\varepsilon }(A)\subseteq R\).

Since \(L_1\) is \(({\mathbb {R}}^2\smallsetminus R)\)-half-open (Lemma 2.12) and R-convex (Lemma 2.13) and \(A\notin L_1\), the set \(\mathscr {N}_{\varepsilon }(A)\cap L_1\) lies entirely in some open half-plane h whose boundary line passes through A. The set \(\mathscr {N}_{\varepsilon }(A)\smallsetminus h\) is p-connected and contains A, so it lies entirely within P. The set \(\mathscr {N}_{\varepsilon }(A)\cap h\) is disjoint from P. Indeed, if there was a point \(B\in \mathscr {N}_{\varepsilon }(A)\cap h\cap P\), then by the R-convexity of P (Lemma 2.14), the convex hull of \(\mathscr {N}_{\varepsilon }(A)\smallsetminus h\) and B would lie entirely within P and would contain A in its interior, which would contradict the assumption that \(A\in \partial P\). It follows that \(\mathscr {N}_{\varepsilon }(A)\cap \partial P\) is an open segment that partitions \(\mathscr {N}_{\varepsilon }(A)\) into two half-discs, one of which (including \(\mathscr {N}_{\varepsilon }(A)\cap \partial P\)) is \(\mathscr {N}_{\varepsilon }(A)\cap P\).

We show that \(\mathscr {N}_{\varepsilon }(A)\cap \partial P\subseteq \partial L_1\). Suppose to the contrary that there is a point \(A'\in \mathscr {N}_{\varepsilon }(A)\cap \partial P\smallsetminus \overline{L_1}\). It follows that \(A'\) has a neighborhood \(\mathscr {N}_{\varepsilon '}(A')\subseteq \mathscr {N}_{\varepsilon }(A)\smallsetminus \overline{L_1}\). Since \(\mathscr {N}_{\varepsilon '}(A')\) is p-connected and contains a point of P, it lies entirely within P. This contradicts the assumption that \(A'\in \partial P\).

Since \(\mathscr {N}_{\varepsilon }(A)\cap \partial P\subseteq \partial L_1\), there is a point \(B\in \mathscr {N}_{\varepsilon }(A)\cap L_1\). Let \(A'\in \mathscr {N}_{\varepsilon }(A)\cap \partial P\). Since \(L_1\) is \(({\mathbb {R}}^2\smallsetminus R)\)-half-open and R-convex and \(A\notin L_1\), there is a point \(C\in \overline{A'B}\) such that \(\overline{CB}\smallsetminus \{C\}\subseteq L_1\) while \(\overline{A'C}\) is disjoint from \(L_1\). The latter implies that \(\overline{A'C}\subseteq P\), as \(A'\in P\). Hence \(C=A'\). This shows the whole triangle T spanned by \(\mathscr {N}_{\varepsilon }(A)\cap \partial P\) and B excluding the open segment \(\mathscr {N}_{\varepsilon }(A)\cap \partial P\) is contained in \(L_1\).

Since A lies in the interior of \(\mathscr {N}_{\varepsilon }(A)\cap (P\cup T)\), it has a neighborhood \(\mathscr {N}_{\varepsilon '}(A)\) that lies entirely within \(\mathscr {N}_{\varepsilon }(A)\cap (P\cup T)\). This neighborhood witnesses the condition 2 for P being \(L_1\)-half-open. \(\square \)

Lemma 2.17

Let P be a branch of R. If \(A_0,A_1\in P\cap \partial P\), then \(\overline{A_0A_1}\subseteq R\).

Proof

Let \(A_0,A_1\in P\cap \partial P\). By Lemma 2.16, P is \(L_1\)-half-open, hence there are \(B_0,B_1\in L_1\) such that \(\overline{A_0B_0}\smallsetminus \{A_0\}\subseteq L_1\) and \(\overline{A_1B_1}\smallsetminus \{A_1\}\subseteq L_1\). There is a polygonal line \(\varGamma _1\) in P connecting \(A_0\) with \(A_1\), and a polygonal line \(\varGamma _2\) in \(L_1\) connecting \(B_0\) with \(B_1\). These polygonal lines together with the line segments \(\overline{A_0B_0}\) and \(\overline{A_1B_1}\) form a closed polygonal curve \(\varGamma \) in R. We can assume without loss of generality that \(\varGamma \) 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 \(\varGamma \) except \(A_0\) and \(A_1\) have the same x-coordinates.

We color the points of \(\varGamma \cap L_1\) red and the points of \(\varGamma \cap P\) blue. For convenience, we assume that \(A_0\) and \(A_1\) have both colors. Let Z denote the interior region delimited by \(\varGamma \) including \(\varGamma \) itself. Since R is simply connected, we have \(Z\subseteq R\).

Let \(x_1<\cdots <x_n\) be the x-coordinates of all vertices of \(\varGamma \). We use [n] to denote the set of indices \(\{1,\ldots ,n\}\). Since the x-coordinates of \(A_0\) and \(A_1\) are zero, there is \(j\in [n]\) such that \(x_j=0\). For \(i\in [n]\), we let \(\ell _i\) be the vertical line \(\{x_i\}\times {\mathbb {R}}\). Since the x-coordinates of the vertices of \(\varGamma \smallsetminus \{A_0,A_1\}\) are distinct, there is at most one vertex of \(\varGamma \) on \(\ell _i\) for every \(i\in [n]\smallsetminus \{j\}\). For \(i\in [n]\), the intersection of Z with \(\ell _i\) is a family of closed line segments with endpoints from \(\varGamma \cap \ell _i\). Some of the segments can be trivial, that is, consisting of a single point, and some segments can contain a point of \(\varGamma \) in their interior.

For \(i\in [n]\) and a point \(A\in \varGamma \cap \ell _i\), we say that a point B is a left neighbor of A if B lies on \(\varGamma \cap \ell _{i-1}\) and \({\overline{AB}}\subseteq \varGamma \). Similarly, B is a right neighbor of A if \(B\in \varGamma \cap \ell _{i+1}\) and \({\overline{AB}}\subseteq \varGamma \). Note that every point \(A\in \varGamma \cap \ell _i\) has exactly two neighbors and if \(A\notin \{A_0,A_1\}\), then the neighbors of A have the same color as A. We distinguish two types of points of \(\varGamma \cap \ell _i\). We say that a point \(A\in \varGamma \cap \ell _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.

Note that every one-sided point is a vertex of \(\varGamma \) and that one-sided points from \(\varGamma \cap \ell _i\) are exactly the points of \(\varGamma \cap \ell _i\) that either form a trivial line segment or that are contained in the interior of some line segment of \(Z\cap \ell _i\). Consequently, every line segment in \(Z\cap \ell _i\) contains at most one point of \(\varGamma \) in its interior.

For \(2\leqslant i\leqslant n\) and \(C,D\in \ell _i\cap \varGamma \), let \({\overline{CD}}\) be a line segment in \(Z\cap \ell _i\) whose interior does not contain a point of \(\varGamma \) with a left neighbor. Let A and B be left neighbors of C and D, respectively, such that there is no left neighbor of C and D between A and B on \(\ell _{i-1}\). Since no point between A and B on \(\ell _{i-1}\) can have a right neighbor, we have \({\overline{AB}}\subseteq Z\cap \ell _{i-1}\) and ABCD are vertices of a trapezoid whose interior is contained in Z. An analogous statement holds for right neighbors of C and D provided that the interior of \({\overline{CD}}\) does not contain a point of \(\varGamma \) with a right neighbor.
Fig. 8

Situation in the proof of Lemma 2.17. Here A is a left neighbor of C and B is a left neighbor of D. The points B, C, and D are two-sided, the points A and E are one-sided

ClaimLet\(i\in [n]\smallsetminus \{j\}\), and letCandDbe points of\(\varGamma \cap \ell _i\)satisfying\(\overline{CD}\subseteq Z\cap \ell _i\). ThenCandDhave the same color.

First, we will prove the claim by induction on i for all \(i<j\). The claim clearly holds for \(i=1\), as \(Z\cap \ell _1\) contains only a single vertex of \(\varGamma \). Fix i with \(1<i<j\) and suppose that the claim holds for \(i-1\). Let \(C,D\in \varGamma \cap \ell _i\) be points satisfying \({\overline{CD}}\subseteq Z\cap \ell _i\). We show that C and D have the same color. Obviously, we can assume that the line segment \({\overline{CD}}\) is non-trivial. Assume first that the points C and D are two-sided.

Suppose the interior of \({\overline{CD}}\) does not contain a point of \(\varGamma \) with a left neighbor. Let \(A,B\in \varGamma \cap \ell _{i-1}\) be the left neighbors of C and D, respectively. Then \({\overline{AB}}\subseteq Z\cap \ell _{i-1}\). Thus A and B have the same color by the induction hypothesis. Since \(C,D\notin \{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 \(\varGamma \) in the interior of \({\overline{CD}}\), 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 \({\overline{CD}}\) contains a point E of \(\varGamma \) with a left neighbor. We have already observed that there is exactly one such point on \({\overline{CD}}\). 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 \(\ell _{i-1}\), form a trapezoid in Z such that \({\overline{AB}}\subseteq Z\cap \ell _{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\leqslant n\). This completes the proof of the claim.

Now, consider the inclusion-maximal line segment \({\overline{CD}}\) of \(Z\cap \ell _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 \({\overline{CD}}\). If \({\overline{CD}}\) is trivial, that is, \(C=D=A_0\), then \(A_0\) is one-sided and its neighbors A and B have different colors, as \(\varGamma \) changes color in \(A_0\). This is impossible according to the claim, since we have \({\overline{AB}}\subseteq Z\cap \ell _{i-1}\) or \({\overline{AB}}\subseteq Z\cap \ell _{i+1}\). Therefore \({\overline{CD}}\) is non-trivial.

First, we assume that \(A_0\) is an endpoint of \({\overline{CD}}\), 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 \(\varGamma \) with a left neighbor in the interior of \(\overline{A_0D}\), then \({\overline{AB}}\subseteq Z\cap \ell _{i-1}\). This is impossible according to the claim. If there is a point \(E\in \varGamma \) with a left neighbor in the interior of \(\overline{A_0D}\), then we can use a similar argument either for the line segment \(\overline{A_0E}\) or for \(\overline{ED}\), as the neighbors of E have the same color. The last case is when \(A_0\) is an interior point of \({\overline{CD}}\). Since \(\varGamma \) does not change color in C nor in D, we apply the claim to one of the line segments \(\overline{A_0C}\), \(\overline{A_0D}\), and \({\overline{CD}}\) 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\cap \ell _i\). This completes the proof, as \(Z\subseteq R\). \(\square \)

Lemma 2.18

For every branch P of R, the set \(P\cap \partial P\) is an open segment.

Proof

Let P be a branch of R. First, we show that the set \(P\cap \partial P\) is convex. Let \(A_0,A_1\in P\cap \partial P\). By Lemma 2.17, we have \(\overline{A_0A_1}\subseteq R\). It follows that \(\overline{A_0A_1}\) is disjoint from the root of R and thus is contained in \({R}^\circ \). By compactness, \(\overline{A_0A_1}\) has a neighborhood \(\mathscr {N}_{\varepsilon }(\overline{A_0A_1})\) contained in \({R}^\circ \). Since P is \(L_1\)-half-open by Lemma 2.16, there are \(B_0,B_1\in \mathscr {N}_{\varepsilon }(\overline{A_0A_1})\cap L_1\) such that \(\overline{A_0B_0}\smallsetminus \{A_0\}\subseteq L_1\) and \(\overline{A_1B_1}\smallsetminus \{A_1\}\subseteq L_1\). For \(t\in [0,1]\), let \(A_t=(1-t)A_0+t A_1\) and \(B_t=(1-t)B_0+tB_1\). We have \(A_t\in \overline{A_0A_1}\) and \(B_t\in \overline{B_0B_1}\), hence \(A_t,B_t\in \mathscr {N}_{\varepsilon }(\overline{A_0A_1})\), for all \(t\in [0,1]\). Now, it follows from the R-convexity of P (Lemma 2.14) and \(L_1\) (Lemma 2.13) that \(A_t\in P\) and \(\overline{A_t B_t}\smallsetminus \{A_t\}\subseteq L_1\), hence \(A_t\in P\cap \partial P\), for all \(t\in [0,1]\). This shows that \(P\cap \partial P\) is convex.

If \(P\cap \partial P\) had three non-collinear points, then they would span a triangle with non-empty interior contained in \(P\cap \partial P\), which would be a contradiction. Since R is bounded, the set \(P\cap \partial P\) is a line segment. That it is an open line segment follows directly from Lemma 2.16. \(\square \)

Lemma 2.19

For every \(j\geqslant 2\), every p-component P of \(\bigcup _{k\geqslant j}L_k\) is a rooted set attached to \(L_{j-1}\). Moreover, for \(k\geqslant 1\), the kth level of P is equal to \(L_{j-1+k}\cap P\).

Proof

The proof proceeds by induction on j. For the base case, let P be a p-component of \(\bigcup _{i\geqslant 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 \(\ell \) be the root of P, and let \((L'_k)_{k\geqslant 1}\) be the partition of P into levels. We prove that \(L'_k\subseteq \bigcup _{i=1}^{k+1}L_i\) and \(L_{k+1}\cap P\subseteq \bigcup _{i=1}^kL'_i\) for every \(k\geqslant 1\).

Let \(A\in L'_k\). It follows that there is a polygonal line \(\varGamma \) with k line segments connecting A to a point \(B\in \ell \). Moreover, since there is no shorter polygonal line connecting A to \(\ell \), the last line segment of \(\varGamma \) is not parallel to \(\ell \). Since P is \(L_1\)-half-open (Lemma 2.16), there is a neighborhood \(\mathscr {N}_{\varepsilon }(B)\) that is split by \(\ell \) into two parts, one of which is a subset of \(L_1\). Let C be a point in \(\mathscr {N}_{\varepsilon }(B)\cap L_1\) such that \(\overline{BC}\) is an extension of the last line segment of \(\varGamma \). Since \(C\in L_1\), there is a point D on the root of R such that \({\overline{CD}}\subseteq L_1\). The polygonal line \(\varGamma \) extended by \(\overline{BC}\) and \({\overline{CD}}\) forms a polygonal line with \(k+1\) line segments connecting A to the root of R. This shows that \(L'_k\subseteq \bigcup _{i=1}^{k+1}L_i\).

Now, let \(A\in L_{k+1}\cap P\). It follows that there is a polygonal line \(\varGamma \) 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\smallsetminus L_1\), there is a point \(B\in \varGamma \) such that the part of \(\varGamma \) between A and B (inclusive) is contained in P and is maximal with this property. It follows that \(B\in \ell \). Since \(B\notin L_1\), the part of \(\varGamma \) between A and B consists of at most k segments. This shows that \(L_{k+1}\cap P\subseteq \bigcup _{i=1}^kL'_i\).

We have thus proved that \(L'_k\subseteq \bigcup _{i=1}^{k+1}L_i\) and \(L_{k+1}\cap P\subseteq \bigcup _{i=1}^kL'_i\) for every \(k\geqslant 1\). To conclude the proof of the base case, we note that a straightforward induction shows that \(L'_k=L_{k+1}\cap P\) for every \(k\geqslant 1\).

For the induction step, let \(j\geqslant 3\), and let P be a p-component of \(\bigcup _{i\geqslant j}L_i\). Let Q be the branch of R containing P. Let \((L'_k)_{k\geqslant 1}\) be the partition of Q into levels. As we have proved for the base case, we have \(L'_k=L_{k+1}\cap Q\) for every \(k\geqslant 1\). Hence P is a p-component of \((\bigcup _{i\geqslant j}L_i)\cap Q=\bigcup _{i\geqslant j-1}L'_i\). By the induction hypothesis, P is a rooted set attached to \(L'_{j-2}\subseteq L_{j-1}\). Moreover, for \(k\geqslant 1\), the kth level of P is equal to \(L'_{j-2+k}\cap P=L_{j-1+k}\). This completes the induction step and proves the lemma. \(\square \)

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={{\mathrm{Vis}}}(r,R)={{\mathrm{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\geqslant 2\). Let Q be the p-component of \(\bigcup _{k\geqslant j}L_k\) containing P. By Lemma 2.19, Q is a rooted set and \(L_j\cap Q\) is the first level of Q. Since \(P\subseteq L_j\cap Q\), the definition of the first level yields \(P=L_j\cap Q={{\mathrm{Vis}}}(r,Q)={{\mathrm{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\geqslant 2\). Let Q be the p-component of \(\bigcup _{k\geqslant 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. \(\square \)

3 General Dimension

This section is devoted to the proofs of Theorems 1.5 and 1.6. In both proofs, we use the operator \({{\mathrm{Aff}}}\) to denote the affine hull of a set of points.

3.1 Proof of Theorem 1.5

Let \(T=(B_0,B_1,\ldots ,B_d)\) be a \((d+1)\)-tuple of distinct affinely independent points in \({\mathbb {R}}^d\). We say that a permutation \(B_0,B_1,\ldots ,B_d\) of T is a regular permutation of T if the following two conditions hold:
  1. 1.

    the segment \(\overline{B_0B_1}\) is the diameter of T,

     
  2. 2.

    for \(i=2,\ldots ,d-1\), the point \(B_i\) has the maximum distance to \({{\mathrm{Aff}}}(\{B_0,\ldots ,B_{i-1}\})\) among the points \(B_i,B_{i+1},\ldots ,B_{d}\).

     
Obviously, T has at least two regular permutations due to the interchangeability of \(B_0\) and \(B_1\). The regular permutation \(B_{i_0},B_{i_1},\ldots ,B_{i_d}\) with the lexicographically minimal vector \(({i_0},{i_1},\ldots ,{i_d})\) is called the canonical permutation of T.
Let T be a \((d+1)\)-tuple of distinct affinely independent points in \({\mathbb {R}}^d\), and let \(B_0,B_1,\ldots ,B_d\) be the canonical permutation of T. For \(i=1,\ldots ,d-1\), we define \({{\mathrm{Box}}}_i(T)\) inductively as follows:
  1. 1.

    \({{\mathrm{Box}}}_1(T):=\overline{B_0B_1}\),

     
  2. 2.
    for \(i=2,\ldots ,d-1\), \({{\mathrm{Box}}}_i(T)\) is the box containing all the points \(P\in {{\mathrm{Aff}}}(\{B_0, B_1,\ldots ,B_i\})\) with the following two properties:
    • the orthogonal projection of P to \({{\mathrm{Aff}}}(\{B_0,B_1,\ldots ,B_{i-1}\})\) lies in \({{\mathrm{Box}}}_{i-1}(T)\),

    • the distance of P to \({{\mathrm{Aff}}}(\{B_0,B_1,\ldots ,B_{i-1}\})\) does not exceed the distance of \(B_i\) to \({{\mathrm{Aff}}}(\{B_0,B_1,\ldots ,B_{i-1}\})\),

     
  3. 3.
    \({{\mathrm{Box}}}_d(T)\) is the box containing all the points \(P\in {\mathbb {R}}^d\) such that the orthogonal projection of P to \({{\mathrm{Aff}}}(\{B_0,B_1,\ldots ,B_{d-1}\})\) lies in \({{\mathrm{Box}}}_{d-1}(T)\) and
    $$\begin{aligned} \lambda _d({{\mathrm{Conv}}}(\{B_0,B_1,\ldots ,B_{d-1},P\}))\leqslant \lambda _d(S){{\mathrm{c}}}(S). \end{aligned}$$
     
The definition of \({{\mathrm{Box}}}_d(T)\) is independent of \(B_d\), so we can define \({{\mathrm{Box}}}_d(T\smallsetminus \{B_d\})\) by
$$\begin{aligned} {{\mathrm{Box}}}_d(T\smallsetminus \{B_d\}):={{\mathrm{Box}}}_d(T). \end{aligned}$$
It is not hard to see that this gives us a proper definition of \({{\mathrm{Box}}}_d(T^{-})\) for every d-tuple \(T^{-}\) of d distinct affinely independent points in \({\mathbb {R}}^d\).

Lemma 3.1

  1. 1.

    For \(i=1,\ldots ,d-1\), the box \({{\mathrm{Box}}}_i(T)\) contains the orthogonal projection of any point of T to \({{\mathrm{Aff}}}(\{B_0,B_1,\ldots ,B_{i-1}\})\).

     
  2. 2.

    If \({{\mathrm{Conv}}}(T)\subseteq S\) then \({{\mathrm{Box}}}_d(T)\) contains the point \(B_d\).

     

Proof

We prove the statement 1 by induction on i. First, let \(i=1\). Then the segment \({{\mathrm{Box}}}_1(T)\) must contain every point \(A_j\in T\) since otherwise one of the segments \(\overline{B_0A_j}\) and \(\overline{B_1A_j}\) would be longer than the segment \(\overline{B_0B_1}\). Further, if a point \(A_j\in T\) satisfies the statement 1 for a parameter \(i\in \{1,\ldots ,d-2\}\) then it also satisfies the statement 1 for the parameter \(i+1\) since otherwise \(A_j\ne B_{i+1}\) and \(A_j\) should have been chosen for \(B_{i+1}\).

The statement 2 follows from the fact that \({{\mathrm{Conv}}}(T)\subseteq S\) implies \(\lambda _d({{\mathrm{Conv}}}(T))\leqslant {{\mathrm{smc}}}(S)=\lambda _d(S){{\mathrm{c}}}(S)\). \(\square \)

For \(i=1,\ldots ,d-1\), let \(d_i\) be the distance of \(B_i\) to \({{\mathrm{Aff}}}(\{B_0,B_1,\ldots ,B_{i-1}\})\). In particular, \(d_1\) is the diameter of T. The following observation follows from the definition of the canonical permutation of T and from the construction of the boxes \({{\mathrm{Box}}}_i(T)\).

Observation 3.2

  1. 1.

    The \((d-1)\)-dimensional measure of the simplex \({{\mathrm{Conv}}}(T\smallsetminus \{B_d\})\) is equal to \(d_1d_2\ldots d_{d-1}/(d-1)!\).

     
  2. 2.

    The sides of \({{\mathrm{Box}}}_d(T)\) have lengths \(d_1,2d_2,\ldots ,2d_{d-1}\), and \(\frac{d!}{d_1d_2\ldots d_{d-1}}\lambda _d(S){{\mathrm{c}}}(S)\).

     

Proof of Theorem 1.5

To estimate \({{\mathrm{b}}}_d(S)\), we partition \({{\mathrm{Simp}}}_{d}(S)\) into the following \(d+2\) subsets: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 \(\lambda _{d(d+1)}(X)=0\). Let \(i\in \{0,\ldots ,d\}\). The set \(Y_i\) is a subset of the set
$$\begin{aligned} Y_i':=\{T=(A_0,\ldots ,A_d)\in S^{d+1}&:T\smallsetminus \{A_i\} \text { is affinely independent and we have}\\&\quad A_i\in {{\mathrm{Box}}}_d(T\smallsetminus \{A_i\})\}. \end{aligned}$$
By Observation 3.2.2, \(\lambda _{d}({{\mathrm{Box}}}_d(T\smallsetminus \{A_i\}))\) is equal to \(z:= 2^{d-2}d!\lambda _d(S){{\mathrm{c}}}(S)\) for every set \(T\smallsetminus \{A_i\}\) appearing in the definition of \(Y_i'\). Therefore, by Fubini’s Theorem, the set \(Y_i'\) is \(\lambda _{d(d+1)}\)-measurable and, moreover,
$$\begin{aligned} \lambda _{d(d+1)}(Y_i')=(\lambda _d(S))^{d}z=(\lambda _d(S))^{d+1}2^{d-2}d!{{\mathrm{c}}}(S). \end{aligned}$$
Thus,
$$\begin{aligned} {{\mathrm{b}}}_{d}(S)= & {} \frac{\lambda _{d(d+1)}({{\mathrm{Simp}}}_{d}(S))}{\lambda _{d}(S)^{d+1}}\\\leqslant & {} \frac{\lambda _{d(d+1)}(X)+\sum _{i=0}^d\lambda _{d(d+1)}(Y_i')}{\lambda _{d}(S)^{d+1}}=2^{d-2}(d+1)!{{\mathrm{c}}}(S). \end{aligned}$$
This completes the proof of Theorem 1.5. \(\square \)

3.2 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 1.6, we show that if we remove an arbitrary n-tuple of points from the open d-dimensional box \((0,1)^d\), then the d-index of convexity of the resulting set is of order \(\varOmega (\frac{1}{n})\).

Lemma 3.3

For every positive integer n and every n-tuple N of points from \((0,1)^d\), the set \(S:=(0,1)^d\smallsetminus N\) satisfies \({{\mathrm{b}}}_{d}(S)\geqslant 1/2n\).

Proof

Let S and \(N=\{B_1,\ldots ,B_n\}\) be the sets from the statement and let 0 be the origin. We use \(S^{d-1}_*\) to denote the set of \((d-1)\)-tuples \((A_1,\ldots ,A_{d-1})\in S^{d-1}\) that satisfy the following: for every \(B\in N\) the points \(A_1,\ldots ,A_{d-1},B\) are affinely independent and \({{\mathrm{Aff}}}(\{A_1,\ldots ,A_{d-1},B\})\cap (N\cup \{0\})=\{B\}\). Note that the set \(S^{d-1}_*\) is measurable and \(\lambda _{d(d-1)}(S^{d-1}_*)=1\). If h is a hyperplane in \({\mathbb {R}}^d\) that does not contain the origin, we use \(h^-\) and \(h^+\) to denote the open half-spaces defined by h such that \(0\in h^-\).

Let \((A_1,\ldots ,A_{d-1})\in S^{d-1}_*\). For a point \(B \in N\), we let \(h_{A_1,\ldots ,A_{d-1},B}\) be the hyperplane determined by the d-tuple \((A_1,\ldots ,A_{d-1},B)\). Since \((A_1,\ldots ,A_{d-1})\in S^{d-1}_*\), we see that \(h_{A_1,\ldots ,A_{d-1},B}\) satisfies \(h_{A_1,\ldots ,A_{d-1},B}\cap N=\{B\}\) and that it does not contain the origin. Therefore the half-spaces \(h_{A_1,\ldots ,A_{d-1},B}^-\) and \(h_{A_1,\ldots ,A_{d-1},B}^+\) are well defined.

For every \((d-1)\)-tuple \((A_1,\ldots ,A_{d-1})\in S^{d-1}_*\), we split the set S into 2n pairwise disjoint open convex sets that are determined by the hyperplanes \(h_{A_1,\ldots ,A_{d-1},B}\) for \(B\in N\). This is done by induction on n. For \(n=1\), we set \(P_1(A_1,\ldots ,A_{d-1}):= S\cap h_{A_1,\ldots ,A_{d-1},B_1}^-\) and \(P_2(A_1,\ldots ,A_{d-1}):= S\cap h_{A_1,\ldots ,A_{d-1},B_1}^+\). Suppose we have split the set S into sets \(P_i(A_1,\ldots ,A_{d-1})\) for \(1\leqslant i\leqslant 2(n-1)\) and \(n\geqslant 2\). Consider the hyperplane \(h_{A_1,\ldots ,A_{d-1},B_n}\). Since for every \(k\in \{1,\ldots ,n-1\}\) the intersection \(h_{A_1,\ldots ,A_{d-1},B_k}\cap h_{A_1,\ldots ,A_{d-1},B_n}\) is the affine hull of \(A_1,\ldots ,A_{d-1}\), we see that \(h_{A_1,\ldots ,A_{d-1},B_n}\smallsetminus {{\mathrm{Aff}}}(\{A_1,\ldots ,A_{d-1}\})\) is contained in two sets \(P_i(A_1,\ldots ,A_{d-1})\) and \(P_j(A_1,\ldots ,A_{d-1})\) for some \(1\leqslant i<j\leqslant 2(n-1)\). We restrict these sets to their intersection with the half-space \(h_{A_1,\ldots ,A_{d-1},B_n}^-\) and set \(P_{2n-1}(A_1,\ldots ,A_{d-1})\) and \(P_{2n}(A_1,\ldots ,A_{d-1})\) as the intersection of \(h_{A_1,\ldots ,A_{d-1},B_n}^+\) with \(P_i(A_1,\ldots ,A_{d-1})\) and \(P_j(A_1,\ldots ,A_{d-1})\), respectively. See Fig. 9 for an illustration.

Since none of the sets \(P_i(A_1,\ldots ,A_{d-1})\) contains a point from N, it can be regarded as an intersection of \((0,1)^d\) with open half-spaces. Therefore every set \(P_i(A_1,\ldots ,A_{d-1})\) is an open convex subset of S. Let \(P(A_1,\ldots ,A_{d-1})\) be the set \(S\smallsetminus \bigl (\bigcup _{B\in N}h_{A_1,\ldots ,A_{d-1},B}\bigr )\). Clearly, \(\lambda _{d}(P(A_1,\ldots ,A_{d-1}))=1\). Since the sets \(P_i(A_1,\ldots ,A_{d-1})\) form a partitioning of \(P(A_1,\ldots ,A_{d-1})\), we also have \(\sum _{i=1}^{2n}\lambda _d(P_i(A_1,\ldots ,A_{d-1}))=1\).

For \(i=1,\ldots ,2n\), we let \(\mathscr {R}_i\) be the subset of \(S^{d-1}_*\times S^2\) defined as
$$\begin{aligned} \mathscr {R}_i:=\{(A_1,\ldots ,A_{d+1}) \in S^{d-1}_*\times S^2:A_d,A_{d+1}\in P_i(A_1,\ldots ,A_{d-1})\}, \end{aligned}$$
and we let \(\mathscr {R}:=\bigcup _{i=1}^{2n}\mathscr {R}_i\). The sets \(\mathscr {R}_i\) are pairwise disjoint and it is not difficult to argue that these sets are measurable. If a \((d+1)\)-tuple \((A_1,\ldots ,A_{d+1})\) is contained in \(\mathscr {R}_i\) for some \(i\in \{1,\ldots ,2n\}\), then \((A_1,\ldots ,A_{d+1})\) is contained in \({{\mathrm{Simp}}}_{d}(S)\), as \(P_i(A_1,\ldots ,A_{d-1})\cup ({{\mathrm{Aff}}}(\{A_1,\ldots ,A_{d-1}\})\cap S)\) is a convex subset of S. Therefore, to find a lower bound for \({{\mathrm{b}}}_{d}(S)=\lambda _{d(d+1)}({{\mathrm{Simp}}}_d(S))\), it suffices to find a lower bound for \(\lambda _{d(d+1)}(\mathscr {R})\), because \(\mathscr {R}\) is a subset of \({{\mathrm{Simp}}}_{d}(S)\). By Fubini’s Theorem, we obtain
$$\begin{aligned} \lambda _{d(d+1)}(\mathscr {R}_i)&=\int _{(A_1,\ldots ,A_{d+1})\in S^{d-1}_*\times S^2}\big [(A_1,\ldots ,A_{d+1})\in \mathscr {R}_i\big ]\\&=\int _{(A_1,\ldots ,A_{d-1})\in S^{d-1}_*}\Big (\int _{(A_d,A_{d+1})\in S^2}\big [A_d,A_{d+1}\in P_i(A_1,\ldots ,A_{d-1})\big ]\Big )\\&=\int _{(A_1,\ldots ,A_{d-1})\in S^{d-1}_*}\lambda _d(P_i(A_1,\ldots ,A_{d-1}))^2, \end{aligned}$$
where \([\phi ]\) is the characteristic function of a logical expression \(\phi \), that is, \([\phi ]\) equals 1 if the condition \(\phi \) holds and 0 otherwise. For the measure of \(\mathscr {R}\) we then derive
$$\begin{aligned} \lambda _{d(d+1)}(\mathscr {R})=\sum _{i=1}^{2n}\lambda _{d(d+1)}(\mathscr {R}_i)=\int _{(A_1,\ldots ,A_{d-1})\in S^{d-1}_*}\sum _{i=1}^{2n}\big (\lambda _d(P_i(A_1,\ldots ,A_{d-1})\big )^2. \end{aligned}$$
Since the function \(x \mapsto x^2\) is convex, we can apply Jensen’s inequality and bound the last term from below by
$$\begin{aligned} \int _{(A_1,\ldots ,A_{d-1})\in S^{d-1}_*} 2n\Big (\frac{\sum _{i=1}^{2n}\lambda _d(P_i(A_1,\ldots ,A_{d-1}))}{2n}\Big )^2=\frac{1}{2n}. \end{aligned}$$
\(\square \)
Fig. 9

The inductive splitting of \(S=(0,1)^2\smallsetminus 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)\)

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 \({\mathbb {R}}^d\) and let \(\mathscr {U}\) be a set system on X. We say that a set \(T \subseteq X\) is shattered by \(\mathscr {U}\) if every subset of T can be obtained as the intersection of some \(U\in \mathscr {U}\) with T. The Vapnik-Chervonenkis dimension (or VC-dimension) of \(\mathscr {U}\), denoted by \(\dim (\mathscr {U})\), is the maximum n (or \(\infty \) if no such maximum exists) for which some subset of X of cardinality n is shattered by \(\mathscr {U}\).

Let \(\mathscr {U}\) be a system of measurable subsets of a set \(X\subseteq {\mathbb {R}}^d\) with \(\lambda _d(X)=1\), and let \(\varepsilon \in (0,1)\) be a real number. A set \(N\subseteq X\) is called an \(\varepsilon \)-net for \((X,\mathscr {U})\) if \(N\cap U\ne \emptyset \) for every \(U\in \mathscr {U}\) with \(\lambda _d(U)\geqslant \varepsilon \).

Theorem 3.4

[13, Thm. 10.2.4] Let X be a subset of \({\mathbb {R}}^d\) with \(\lambda _d(X)=1\). Then for every system \(\mathscr {U}\) of measurable subsets of X with \(\dim (\mathscr {U})\leqslant v\), \(v\geqslant 2\), there is a \(\frac{1}{r}\)-net for \((X,\mathscr {U})\) of size at most \(2vr\log _2 r\) for r sufficiently large with respect to v.

To apply Theorem 3.4, the VC-dimension of the set system \(\mathscr {U}\) has to be finite. However, it is known that the VC-dimension of all convex sets in \({\mathbb {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 \({\mathbb {R}}^d\) is an image of the closed d-dimensional unit ball under a nonsingular affine map. A convex body in \({\mathbb {R}}^d\) is a compact convex subset of \({\mathbb {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.

Lemma 3.5

[13, Thm. 13.4.1] For every d-dimensional convex body \(K\subseteq {\mathbb {R}}^d\), there is a d-dimensional ellipsoid E with the center C that satisfies
$$\begin{aligned} E\subseteq K\subseteq C+d(E-C). \end{aligned}$$
In particular, we have \(\lambda _d(K)/d^d\leqslant \lambda _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 \(\mathscr {E}\) of d-dimensional ellipsoids in \({\mathbb {R}}^d\) is at most \(\left( {\begin{array}{c}d+2\\ d\end{array}}\right) \).

Lemma 3.6

[13, Prop. 10.3.2] Let \({\mathbb {R}}[x_1,\ldots ,x_d]_{\leqslant t}\) denote the set of real polynomials in d variables of degree at most t, and let
$$\begin{aligned} \mathscr {P}_{d,t}=\big \{\{x\in {\mathbb {R}}^d:p(x)\geqslant 0\}:p\in {\mathbb {R}}[x_1,\ldots ,x_d]_{\leqslant t}\big \}. \end{aligned}$$
Then \(\dim (\mathscr {P}_{d,t})\leqslant \left( {\begin{array}{c}d+t\\ d\end{array}}\right) \).

Proof of Theorem 1.6

Suppose we are given \(\varepsilon >0\) which is sufficiently small with respect to d. We show how to construct a set \(S \subseteq {\mathbb {R}}^d\) with \(\lambda _d(S)=1\) satisfying \({{\mathrm{c}}}(S)\leqslant \varepsilon \) and
$$\begin{aligned} {{\mathrm{b}}}_{d}(S)\geqslant \frac{1}{8\left( {\begin{array}{c}d+2\\ d\end{array}}\right) d^d}\cdot \frac{\varepsilon }{\log _2{1/\varepsilon }}. \end{aligned}$$
Without loss of generality we assume that \(\varepsilon =d^d/r\) for some integer \(r\geqslant 2d^{2d}\).

Consider the open d-dimensional box \((0,1)^d\) and the system \({\mathscr {E}}\upharpoonright (0,1)^{d}\) of d-dimensional ellipsoids in \((0,1)^d\). Since the restriction of \({\mathscr {E}}\) to \((0,1)^{d}\) does not increase the VC-dimension, Lemma 3.6 implies \(\dim ({\mathscr {E}}\upharpoonright (0,1)^{d})\leqslant \left( {\begin{array}{c}d+2\\ d\end{array}}\right) \).

If we set \(n:= 2\left( {\begin{array}{c}d+2\\ d\end{array}}\right) r\lceil \log _2{r}\rceil \), then, by Theorem 3.4, there is a \(\frac{1}{r}\)-net N for the system \(((0,1)^d,\mathscr {E}\upharpoonright (0,1)^d)\) of size n, having r sufficiently large with respect to d. Let S be the set \((0,1)^d\smallsetminus N\). Clearly, we have \(\lambda _d(S)=1\).

Suppose K is a convex subset of \((0,1)^d\) with \(\lambda _d(K)>\varepsilon \). Since the measure of K is positive, we can assume that K is a convex body of measure at least \(\varepsilon \). By Lemma 3.5, the convex body K contains a d-dimensional ellipsoid E with \(\lambda _d(E)\geqslant \varepsilon /d^d=\frac{1}{r}\). Therefore \(E\cap N\ne \emptyset \). Since we have \(E\subseteq K\) and \(N\cap S=\emptyset \), we see that K is not a subset of S. In other words, we have \({{\mathrm{c}}}(S)\leqslant \varepsilon \).

By Lemma 3.3, we have \({{\mathrm{b}}}_{d}(S)\geqslant \frac{1}{2n}\). According to the choice of n and r, the term \(\frac{1}{2n}\) is bounded from below by
$$\begin{aligned} \frac{1}{4\left( {\begin{array}{c}d+2\\ d\end{array}}\right) r\log _2{2r}} = \frac{\varepsilon }{4\left( {\begin{array}{c}d+2\\ d\end{array}}\right) d^d\log _2{(2d^d/\varepsilon )}} \geqslant \frac{1}{8\left( {\begin{array}{c}d+2\\ d\end{array}}\right) d^d}\cdot \frac{\varepsilon }{\log _2{1/\varepsilon }}, \end{aligned}$$
where the last inequality follows from the estimate \(2d^d\leqslant 1/\varepsilon \). This completes the proof of Theorem 1.6. \(\square \)

It is a natural question whether the bound for \({{\mathrm{b}}}_{d}(S)\) in Theorem 1.6 can be improved to \({{\mathrm{b}}}_{d}(S)=\varOmega ({{\mathrm{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 \(\varepsilon >0\) there is a set \(N'\subseteq (0,1)^2\) of size \(O(\frac{1}{\varepsilon })\) with the property that every convex set of area \(\varepsilon \) 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 \({{\mathrm{b}}}_2(S)\). However it is generally believed that the answer is likely to be nonlinear in \(\frac{1}{\varepsilon }\).

3.3 A Set with Large k-Index of Convexity and Small Convexity Ratio

Proposition 3.7

For every integer\(d\geqslant 2\), the set\(S:=[0,1]^d\smallsetminus {\mathbb {Q}}^d\)satisfies\({{\mathrm{c}}}(S)=0\)and\({{\mathrm{b}}}_k(S)=1\)for every positive integer\(k<d\).

Proof

Since \({\mathbb {Q}}^d\) is countable and \(\lambda _d([0,1]^d)=1\), we have \(\lambda _d(S)=1\). Every convex subset K of \([0,1]^d\) with positive d-dimensional measure contains an open d-dimensional ball \(\mathfrak {B}\) with positive diameter, as there is a \((d+1)\)-tuple of affinely independent points of K. Since \({\mathbb {Q}}^d\) is a dense subset of \({\mathbb {R}}^d\), we see that \(\mathfrak {B}\cap {\mathbb {Q}}^d\ne \emptyset \) and thus \({{\mathrm{c}}}(S)=0\).

It remains to estimate \({{\mathrm{b}}}_k(S)\). By Fubini’s Theorem, we have
$$\begin{aligned} {{\mathrm{b}}}_k(S)=\int _{(B_1,\ldots ,B_k)\in S^k}\frac{\lambda _d(\{A\in S:{{\mathrm{Conv}}}(\{B_1,\ldots ,B_k,A\})\subseteq S\})}{\lambda _d(S)^{k+1}}. \end{aligned}$$
If A is a point of S such that \({{\mathrm{Conv}}}(\{B_1,\ldots ,B_k,A\})\) is not contained in S, then A is a point of the affine hull \({{\mathrm{Aff}}}(\{B_1,\ldots ,B_k,Q\})\) of \(B_1,\ldots ,B_k\) and some \(Q\in {\mathbb {Q}}^d\). Therefore, \({{\mathrm{b}}}_k(S)\) is at least
$$\begin{aligned} \int _{(B_1,\ldots ,B_k)\in S^k}\frac{\lambda _d\big ([0,1]^d\big )-\lambda _d\big (\bigcup _{Q\in {\mathbb {Q}}^d}{{\mathrm{Aff}}}(\{B_1,\ldots ,B_k,Q\})\big )}{\lambda _d(S)^{k+1}}. \end{aligned}$$
A countable union of affine subspaces of dimension less than d has d-dimensional measure zero and we already know that \(\lambda _d(S)=1=\lambda _d([0,1]^d)\), hence \({{\mathrm{b}}}_k(S)=1\). \(\square \)

4 Other Variants and Open Problems

We have seen in Theorem 1.3 that a p-componentwise simply connected set \(S\subseteq {\mathbb {R}}^2\) whose \({{\mathrm{b}}}(S)\) is defined satisfies \({{\mathrm{b}}}(S)\leqslant \alpha {{\mathrm{c}}}(S)\), for an absolute constant \(\alpha \leqslant 180\). Equivalently, such a set S satisfies \({{\mathrm{smc}}}(S)\geqslant {{\mathrm{b}}}(S)\lambda _2(S)/180\).

By a result of Blaschke [4] (see also Sas [18]), every convex set \(K\subseteq {\mathbb {R}}^2\) contains a triangle of measure at least \(\frac{3\sqrt{3}}{4\pi }\lambda _2(K)\). In view of this, Theorem 1.3 yields the following consequence.

Corollary 4.1

There is a constant \(\alpha >0\) such that every p-componentwise simply connected set \(S\subseteq {\mathbb {R}}^2\) whose \({{\mathrm{b}}}(S)\) is defined contains a triangle \(T\subseteq S\) of measure at least \(\alpha {{\mathrm{b}}}(S)\lambda _2(S)\).

A similar argument works in higher dimensions as well. For every \(d\geqslant 2\), there is a constant \(\beta =\beta (d)\) such that every convex set \(K\subseteq {\mathbb {R}}^d\) contains a simplex of measure at least \(\beta \lambda _d(K)\) (see e.g. Lassak [12]). Therefore, Theorem 1.5 can be rephrased in the following equivalent form.

Corollary 4.2

For every \(d\geqslant 2\), there is a constant \(\alpha =\alpha (d)>0\) such that every set \(S\subseteq {\mathbb {R}}^d\) whose \({{\mathrm{b}}}_{d}(S)\) is defined contains a simplex T of measure at least \(\alpha {{\mathrm{b}}}_{d}(S)\lambda _d(S)\).

What can we say about sets \(S\subseteq {\mathbb {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 Sp-componentwise simply\(\triangle \)-connected if for every triangle T such that \(\partial T\subseteq S\) we have \(T\subseteq S\). We conjecture that Theorem 1.3 can be extended to p-componentwise simply \(\triangle \)-connected sets.

Conjecture 4.3

There is an absolute constant \(\alpha >0\) such that every p-componentwise simply \(\triangle \)-connected set \(S\subseteq {\mathbb {R}}^2\) whose \({{\mathrm{b}}}(S)\) is defined satisfies \({{\mathrm{b}}}(S)\leqslant \alpha {{\mathrm{c}}}(S)\).

What does the value of \({{\mathrm{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 \({{\mathrm{b}}}(S)\) is equal to 1. However, we conjecture that a large \({{\mathrm{b}}}(S)\) implies the existence of a large convex set whose boundary belongs to S.

Conjecture 4.4

For every \(\varepsilon >0\), there is a \(\delta >0\) such that if \(S\subseteq {\mathbb {R}}^2\) is a set with \({{\mathrm{b}}}(S)\geqslant \varepsilon \), then there is a bounded convex set \(C\subseteq {\mathbb {R}}^2\) with \(\lambda (C)\geqslant \delta \lambda (S)\) and \(\partial C\subseteq S\).

Theorem 1.3 shows that Conjecture 4.4 holds for p-componentwise simply connected sets, with \(\delta \) being a constant multiple of \(\varepsilon \). It is possible that even in the general setting of Conjecture 4.4, \(\delta \) can be taken as a constant multiple of \(\varepsilon \).

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 \(\varepsilon >0\), there is a \(\delta >0\) such that if \(S\subseteq {\mathbb {R}}^2\) is a set with \({{\mathrm{b}}}(S)\geqslant \varepsilon \), then there is a triangle \(T\subseteq {\mathbb {R}}^2\) with \(\lambda (T)\geqslant \delta \lambda (S)\) and \(\partial T\subseteq 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\subseteq {\mathbb {R}}^d\), let \(\left( {\begin{array}{c}X\\ k\end{array}}\right) \) be the set of k-element subsets of X, and let the set \({{\mathrm{Skel}}}_k(X)\) be defined by
$$\begin{aligned} {{\mathrm{Skel}}}_k(X):=\bigcup _{Y\in \left( {\begin{array}{c}X\\ k+1\end{array}}\right) }{{\mathrm{Conv}}}(Y). \end{aligned}$$
If X is the vertex set of a d-dimensional simplex \(T={{\mathrm{Conv}}}(X)\), then \({{\mathrm{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\in {\mathbb {N}}\) such that \(1\leqslant k\leqslant d\) and every \(\varepsilon >0\), there is a \(\delta >0\) such that if \(S\subseteq {\mathbb {R}}^d\) is a set with \({{\mathrm{b}}}_k(S)\geqslant \varepsilon \), then there is a simplex T with vertex set X such that \(\lambda _d(T)\geqslant \delta \lambda _d(S)\) and \({{\mathrm{Skel}}}_k(X)\subseteq S\).

Corollary 4.2 asserts that this conjecture holds in the special case of \(k=d\geqslant 2\), since \({{\mathrm{Skel}}}_{d}(X)={{\mathrm{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, \(\delta \) can be taken as a constant multiple of \(\varepsilon \), 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.

Conjecture 4.7

For every \(d\geqslant 2\), there is a constant \(\alpha =\alpha (d)>0\) such that if \(S\subseteq {\mathbb {R}}^d\) is a set with \({{\mathrm{b}}}_{d-1}(S)\) defined whose every p-component is contractible, then \({{\mathrm{b}}}_{d-1}(S)\leqslant \alpha {{\mathrm{c}}}(S)\).

A modification of the proof of Theorem 1.5 implies that Conjecture 4.7 is true for star-shaped sets S.

Notes

Acknowledgments

The first three authors were supported by the Grant GAČR 14-14179S. The first author acknowledges the support of the Grant Agency of the Charles University, GAUK 690214 and the Grant SVV-2015-260223. The last author was supported by the Ministry of Science and Higher Education of Poland Mobility Plus Grant 911/MOB/2012/0. The authors would like to thank Marek Eliáš for interesting discussions about the problem and participation in our meetings during the early stages of the research.

References

  1. 1.
    Beer, G.A.: Continuity properties of the visibility function. Mich. Math. J. 20(4), 297–302 (1973)MathSciNetMATHGoogle Scholar
  2. 2.
    Beer, G.A.: The index of convexity and the visibility function. Pac. J. Math. 44(1), 59–67 (1973)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Beer, G.A.: The index of convexity and parallel bodies. Pac. J. Math. 53(2), 337–345 (1974)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Blaschke, W.: Über affine Geometrie III: Eine Minimumeigenschaft der Ellipse. Ber. Verh. Kön. Sächs. Ges. Wiss. Leipzig Math.-Phys. Kl. 69, 3–12 (1917)MATHGoogle Scholar
  5. 5.
    Bradford, P.G., Capoyleas, V.: Weak \(\varepsilon \)-nets for points on a hypersphere. Discrete Comput. Geom. 18(1), 83–91 (1997)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Cabello, S., Cibulka, J., Kynčl, J., Saumell, M., Valtr, P.: Peeling potatoes near-optimally in near-linear time. In: Cheng, S.W., Devillers, O. (eds.) 30th Annual Symposium on Computational Geometry (SoCG 2014), pp. 224–231. ACM, New York (2014)Google Scholar
  7. 7.
    Croft, H.T., Falconer, K.J., Guy, R.K.: Unsolved Problems in Geometry, Unsolved Problems in Intuitive Mathematics, vol. 2. Springer, New York (1991)CrossRefMATHGoogle Scholar
  8. 8.
    Goodman, J.E.: On the largest convex polygon contained in a non-convex \(n\)-gon, or how to peel a potato. Geom. Dedicata 11(1), 99–106 (1981)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Haussler, D., Welzl, E.: Epsilon-nets and simplex range queries. Discrete Comput. Geom. 2(2), 127–151 (1987)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    John, F.: Extremum problems with inequalities as subsidiary conditions. In: Studies and Essays, presented to R. Courant on his 60th birthday, January 8, 1948, pp. 187–204. Interscience, NewYork (1948)Google Scholar
  11. 11.
    Lang, R.: A note on the measurability of convex sets. Arch. Math. 47(1), 90–92 (1986)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Lassak, M.: Approximation of convex bodies by inscribed simplices of maximum volume. Beitr. Algebra Geom. 52(2), 389–394 (2011)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Matoušek, J.: Lectures on Discrete Geometry. Graduate Texts in Mathematics, vol. 212. Springer, New York (2002)CrossRefMATHGoogle Scholar
  14. 14.
    Pach, J., Tardos, G.: Piercing quasi-rectangles—on a problem of Danzer and Rogers. J. Comb. Theory Ser. A 119(7), 1391–1397 (2012)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Prasolov, V.V.: Elements of combinatorial and differential topology. In: Graduate Studies in Mathematics, vol. 74. American Mathematical Society, Providence (2006)Google Scholar
  16. 16.
    Rote, G.: The degree of convexity. In: Abstracts of the 29th European Workshop on Computational Geometry, pp. 69–72 (2013)Google Scholar
  17. 17.
    Rudin, W.: Real and Complex Analysis, 3rd edn. McGraw-Hill, New York (1987)MATHGoogle Scholar
  18. 18.
    Sas, E.: Über eine Extremumeigenschaft der Ellipsen. Compos. Math. 6, 468–470 (1939)MathSciNetMATHGoogle Scholar
  19. 19.
    Stern, H.I.: Polygonal entropy: a convexity measure for polygons. Pattern Recognit. Lett. 10(4), 229–235 (1989)CrossRefMATHGoogle Scholar

Copyright information

© The Author(s) 2016

Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Authors and Affiliations

  • Martin Balko
    • 1
  • Vít Jelínek
    • 2
  • Pavel Valtr
    • 1
  • Bartosz Walczak
    • 3
  1. 1.Department of Applied Mathematics, Faculty of Mathematics and PhysicsCharles UniversityPrague 1Czech Republic
  2. 2.Computer Science Institute, Faculty of Mathematics and PhysicsCharles UniversityPrague 1Czech Republic
  3. 3.Theoretical Computer Science Department, Faculty of Mathematics and Computer ScienceJagiellonian UniversityKrakówPoland

Personalised recommendations