
doi: 10.1007/bf01636930
In a Minkowski space with unit ball S, a set D(\(\lambda)\) is diametrically complete if \(D(\lambda)=\cap \{d+\lambda S:\) \(d\in D(\lambda)\}\). In this paper a method is given for generating such sets D(\(\lambda)\) which contain an arbitrary set X. This technique is then employed to find necessary and sufficient conditions for a set A to lie on the boundary of some such D(\(\lambda)\), and bounds are given on the acceptable values of \(\lambda\).
510.mathematics, Minkowski space, convex sets, diametrically complete, Convex sets in \(n\) dimensions (including convex hypersurfaces), Article
510.mathematics, Minkowski space, convex sets, diametrically complete, Convex sets in \(n\) dimensions (including convex hypersurfaces), Article
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 5 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
