Macbeath region

Uses your system voice; voice and rate in settings.

Snapshot

≈ 2 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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 . The idea was introduced by 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.

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 . The idea was introduced by 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. {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^{\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 λ.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1360781096 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.