The least-perimeter partition of a sphere into four equal areas
DOI10.1007/S00454-009-9197-8zbMATH Open1208.52002arXiv0903.4097OpenAlexW1994708599WikidataQ125079777 ScholiaQ125079777MaRDI QIDQ603841FDOQ603841
Authors: Max Engelstein
Publication date: 8 November 2010
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0903.4097
Recommendations
Combinatorial aspects of tessellation and tiling problems (05B45) Convex sets in (2) dimensions (including convex curves) (52A10) Length, area and volume in real or complex geometry (51M25) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)
Cites Work
Cited In (10)
- Minimal clusters of four planar regions with the same area
- Minimal connected partitions of the sphere
- Local conditions for the regularity of the partition of a two-dimensional sphere
- A partition of the unit sphere into regions of equal area and small diameter
- Least-perimeter partitions of the disk into three regions of given areas
- Isoperimetric problems on the sphere and on surfaces with density
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimal cluster computation for four planar regions with the same area
- A property of the bidimensional sphere
This page was built for publication: The least-perimeter partition of a sphere into four equal areas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q603841)