No label defined (Q4352329)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1054781
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1054781

      Statements

      0 references
      27 April 1998
      0 references
      shortest partitioning nets
      0 references
      2-spheres
      0 references
      Plateau nets
      0 references
      It is known that any least-perimeter partition of the sphere \(S^2\) (in Euclidean space \(E^3\)) into domains of given area must consist of circular arcs meeting in these at equal angles. Nets which satisfy these necessary conditions are called Plateau nets. In 1964, the author has determined all 10 Plateau nets on \(S^2\) under the restriction that the domains are convex, among them the five irregular nets \(N_5\), \(N_7\), \(N_8\), \(N_9\), \(N_{10}\) which are indexed by the number of their faces. He now proves the Theorem: None of these five irregular convex Plateau nets on \(S^2\) provides the optimal solution of the (general) least-perimeter partitioning problem. To prove this, in each case a better partitioning is constructed. Further results are: None of \(N_5\), \(N_7\) and \(N_9\) provides the optimal solution of the appropriate convex partitioning problem; there exist at most five cases when the general least-perimeter partitioning of the sphere consists of convex domains: these are the regular partitioning into \(2\), \(3\), \(4\), \(6\) or \(12\) parts of equal area. For the entire collection see [Zbl 0868.00054].
      0 references
      0 references

      Identifiers