Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 4

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  suma Minkowskiego
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
The fusion under unknown correlations tunes a combination of local estimates in such a way that upper bounds of the admissible mean square error matrices are optimised. Based on the recently discovered relation between the admissible matrices and Minkowski sums of ellipsoids, the optimality of existing algorithms is analysed. Simple examples are used to indicate the reasons for the suboptimality of the covariance intersection fusion of multiple estimates. Further, an extension of the existing family of upper bounds is proposed, which makes it possible to get closer to the optimum, and a general case is discussed. All results are obtained analytically and illustrated graphically.
2
Content available remote Strongly monotypic polytopes in R3
EN
McMullen et al. [3] characterized all three-dimensional monotypic polytopes by presenting four types of such polytopes. They stated that three of these types are strongly monotypic polytopes. We examine which monotypic polytopes of the fourth type are strongly monotypic. This way we complete the description of all strongly monotypic polytopes in R3.
EN
The relative distance of points p and g of a convex body C is the ratio of the length of the segment pq to the half of the length of a longest chord of C parallel to pq. In this paper we find a connection between pairwise relative distances of k points in the boundary of a convex body and the rafio of k homothetical copies of a convex body touching it.
4
Content available remote On common summands and anti-summands of compact convex sets
EN
In this paper we examine families of common summands and anti-summands of compact convex sets. In particular, we prove the equivalence of minimality problems for common anti-summands and minimal pairs of compact convex sets. We also give partial answers to the question whether minimal anti-summands of polytopes are polytopes as well.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.