In mathematics, a MacBeath region is an explicitly defined region in convex analysis on a bounded convex subset of d-dimensional Euclidean space R d {\displaystyle \mathbb {R} ^{d}} . The idea was introduced by Alexander Murray MacBeath (1952) and dubbed by G. Ewald, D. G. Larman and C. A. Rogers in 1970. MacBeath regions have been used to solve certain complex problems in the study of the boundaries of convex bodies. Recently they have been used in the study of convex approximations and other aspects of computational geometry.
Definition Let K be a bounded convex set in a Euclidean space. Given a point x and a scalar λ the λ-scaled MacBeath region around a point x is:
M K ( x ) = K ∩ ( 2 x − K ) = x + ( ( K − x ) ∩ ( x − K ) ) = { k ′ ∈ K | ∃ k ∈ K and k ′ − x = x − k } {\displaystyle {M_{K}}(x)=K\cap (2x-K)=x+((K-x)\cap (x-K))=\{k'\in K|\exists k\in K{\text{ and }}k'-x=x-k\}}
The scaled MacBeath region at x is defined as:
M K λ ( x ) = x + λ ( ( K − x ) ∩ ( x − K ) ) = { ( 1 − λ ) x + λ k ′ | k ′ ∈ K , ∃ k ∈ K and k ′ − x = x − k } {\displaystyle M_{K}^{\lambda }(x)=x+\lambda ((K-x)\cap (x-K))=\{(1-\lambda )x+\lambda k'|k'\in K,\exists k\in K{\text{ and }}k'-x=x-k\}}
This can be seen to be the intersection of K with the reflection of K around x scaled by λ.
Example uses MacBeath regions can be used to create ϵ {\displaystyle \epsilon } approximations, with respect to the Hausdorff distance, of convex shapes within a factor of O ( log d + 1 2 ( 1 ϵ ) ) {\displaystyle O(\log ^{\frac {d+1}{2}}({\frac {1}{\epsilon }}))} combinatorial complexity of the lower bound. MacBeath regions can be used to approximate balls in the Hilbert metric, e.g. given any convex K, containing an x and a 0 ≤ λ < 1 {\displaystyle 0\leq \lambda <1} then:
B H ( x , 1 2 ln ( 1 + λ ) ) ⊂ M λ ( x ) ⊂ B H ( x , 1 2 ln 1 + λ 1 − λ ) {\displaystyle B_{H}\left(x,{\frac {1}{2}}\ln(1+\lambda )\right)\subset M^{\lambda }(x)\subset B_{H}\left(x,{\frac {1}{2}}\ln {\frac {1+\lambda }{1-\lambda }}\right)}
Dikin’s Method
… excerpt ends here. Continue reading the full article.


