On translative coverings of convex bodies (Q470407): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
In this paper the authors consider \textit{translative coverings} of a convex body, defined as families of proper translates of the body, covering it, and examine some other related concepts. This problem is a variant of the classical problem of covering a convex body by its smaller positive homothetical copies, introduced by Hadwiger. If \(K\) is a convex body, let \(t(K)\) (respectively, \(h(K)\)) denote the minimum number of proper translates (respectively, smaller positive homothetic copies)of \(K\), covering \(K\), and note that \(t(K) \leq h(K)\) for every convex body. After a preliminary part, in Section 2 the authors investigate how the boundary of \(K\) can be covered by proper translates of the body. In particular, the prove that it can be carried out with \(t(K)\) number of translates. For centrally symmetric, strictly convex planar bodies they prove generalizations of Tiţeica's and Miquel's theorems. In Section 3 they define a similar variant of the classical illumination problem. They say that a point \(x \in K\) is \(t\)-\textit{illuminated} by a direction \(\delta\), if there is some (not necessarily interior) point \(y \in K\) such that the vector \(\overrightarrow{xy}\) has direction \(\delta\). The smallest number of directions \(t\)-illuminating every point of \(K\) is denoted by \(i(K)\). The authors prove that for every convex body \(K\), the inequality \(i(K) \leq t(K)\) holds and, if, in particular, \(K\) is strictly convex or planar, \(iK) = t(K)\). Nevertheless, they describe a counterexample showing that, in general, \(i(K) < t(K)\) holds for some convex body \(K\). In Section 4 the authors investigate the problem of characterizing the convex bodies \(K\) with the property that \(t(K) = h(K)\). Finally, in Section 5 they prove bounds on the values of \(t(K)\).
Property / review text: In this paper the authors consider \textit{translative coverings} of a convex body, defined as families of proper translates of the body, covering it, and examine some other related concepts. This problem is a variant of the classical problem of covering a convex body by its smaller positive homothetical copies, introduced by Hadwiger. If \(K\) is a convex body, let \(t(K)\) (respectively, \(h(K)\)) denote the minimum number of proper translates (respectively, smaller positive homothetic copies)of \(K\), covering \(K\), and note that \(t(K) \leq h(K)\) for every convex body. After a preliminary part, in Section 2 the authors investigate how the boundary of \(K\) can be covered by proper translates of the body. In particular, the prove that it can be carried out with \(t(K)\) number of translates. For centrally symmetric, strictly convex planar bodies they prove generalizations of Tiţeica's and Miquel's theorems. In Section 3 they define a similar variant of the classical illumination problem. They say that a point \(x \in K\) is \(t\)-\textit{illuminated} by a direction \(\delta\), if there is some (not necessarily interior) point \(y \in K\) such that the vector \(\overrightarrow{xy}\) has direction \(\delta\). The smallest number of directions \(t\)-illuminating every point of \(K\) is denoted by \(i(K)\). The authors prove that for every convex body \(K\), the inequality \(i(K) \leq t(K)\) holds and, if, in particular, \(K\) is strictly convex or planar, \(iK) = t(K)\). Nevertheless, they describe a counterexample showing that, in general, \(i(K) < t(K)\) holds for some convex body \(K\). In Section 4 the authors investigate the problem of characterizing the convex bodies \(K\) with the property that \(t(K) = h(K)\). Finally, in Section 5 they prove bounds on the values of \(t(K)\). / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Zsolt Lángi / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 52C17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 52A20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 52A40 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6368766 / rank
 
Normal rank
Property / zbMATH Keywords
 
covering number
Property / zbMATH Keywords: covering number / rank
 
Normal rank
Property / zbMATH Keywords
 
Hadwiger's covering problem
Property / zbMATH Keywords: Hadwiger's covering problem / rank
 
Normal rank
Property / zbMATH Keywords
 
illumination
Property / zbMATH Keywords: illumination / rank
 
Normal rank
Property / zbMATH Keywords
 
Miquel's theorem
Property / zbMATH Keywords: Miquel's theorem / rank
 
Normal rank
Property / zbMATH Keywords
 
Tiţeica's theorem
Property / zbMATH Keywords: Tiţeica's theorem / rank
 
Normal rank
Property / zbMATH Keywords
 
translative covering
Property / zbMATH Keywords: translative covering / rank
 
Normal rank
Property / zbMATH Keywords
 
visibility
Property / zbMATH Keywords: visibility / rank
 
Normal rank
Property / zbMATH Keywords
 
Voronoi region
Property / zbMATH Keywords: Voronoi region / rank
 
Normal rank

Revision as of 16:28, 30 June 2023

scientific article
Language Label Description Also known as
English
On translative coverings of convex bodies
scientific article

    Statements

    On translative coverings of convex bodies (English)
    0 references
    0 references
    0 references
    0 references
    12 November 2014
    0 references
    In this paper the authors consider \textit{translative coverings} of a convex body, defined as families of proper translates of the body, covering it, and examine some other related concepts. This problem is a variant of the classical problem of covering a convex body by its smaller positive homothetical copies, introduced by Hadwiger. If \(K\) is a convex body, let \(t(K)\) (respectively, \(h(K)\)) denote the minimum number of proper translates (respectively, smaller positive homothetic copies)of \(K\), covering \(K\), and note that \(t(K) \leq h(K)\) for every convex body. After a preliminary part, in Section 2 the authors investigate how the boundary of \(K\) can be covered by proper translates of the body. In particular, the prove that it can be carried out with \(t(K)\) number of translates. For centrally symmetric, strictly convex planar bodies they prove generalizations of Tiţeica's and Miquel's theorems. In Section 3 they define a similar variant of the classical illumination problem. They say that a point \(x \in K\) is \(t\)-\textit{illuminated} by a direction \(\delta\), if there is some (not necessarily interior) point \(y \in K\) such that the vector \(\overrightarrow{xy}\) has direction \(\delta\). The smallest number of directions \(t\)-illuminating every point of \(K\) is denoted by \(i(K)\). The authors prove that for every convex body \(K\), the inequality \(i(K) \leq t(K)\) holds and, if, in particular, \(K\) is strictly convex or planar, \(iK) = t(K)\). Nevertheless, they describe a counterexample showing that, in general, \(i(K) < t(K)\) holds for some convex body \(K\). In Section 4 the authors investigate the problem of characterizing the convex bodies \(K\) with the property that \(t(K) = h(K)\). Finally, in Section 5 they prove bounds on the values of \(t(K)\).
    0 references
    0 references
    covering number
    0 references
    Hadwiger's covering problem
    0 references
    illumination
    0 references
    Miquel's theorem
    0 references
    Tiţeica's theorem
    0 references
    translative covering
    0 references
    visibility
    0 references
    Voronoi region
    0 references

    Identifiers