Language:   Search:   Contact
World of
Mathematics
Database
»ZBMATH«
MSC 2000
MSC 2010
Reviewer
Service
Subscription
»ZBMATH«
ZBMATH Database | Advanced Search Print
Read more | Try MathML | Hide
Zentralblatt MATH has released its new interface!
For an improved author identification, see the new author database of ZBMATH.

ZBMATH Database Simple Search Advanced Search Command Search

Advanced Search

Query:
Fill in the form and click »Search«...
Format:
Display: entries per page entries
Zbl 1133.52002
Kawohl, Bernd; Lachand-Robert, Thomas
Characterization of Cheeger sets for convex subsets of the plane.
(English)
[J] Pac. J. Math. 225, No. 1, 103-118 (2006). ISSN 0030-8730

A Cheeger set of a body $\Omega$ is a subset that maximizes the ratio of volume to boundary. For dimensional reasons, larger sets have an advantage here: in particular, a Cheeger set must meet the boundary of $\Omega$ more than once, as otherwise a larger homothetic subset would exist, yielding a better ratio. On the other hand, it is not hard to see that extending the subset into small corners of $\Omega$ must reach a point of diminishing returns, getting less and less volume in return for each increase in boundary. In the plane, it is known that Cheeger sets of convex bodies are unique; in higher dimensions very little is known.\par The authors characterize the Cheeger set of a convex planar body as follows. For any $\Omega$, there exists a unique $t$ such that the inner parallel body to $\Omega$ at distance $t$ has the same area as the disc of radius $t$; and the Cheeger set is the Minkowski sum of this inner parallel body and disc. In some cases (known elsewhere in the literature as ``calibrable sets'') the Cheeger set is equal to $\Omega$; a simple characterization of such sets (not, as the authors point out, entirely novel) is given. For convex polygons some additional results are given, including a characterization of polygons whose Cheeger set touches every edge. For such polygons, it is possible to compute the volume-to boundary ratio directly from the area, perimeter, and angles of the polygon. Finally, some rather nice counterexamples are given to show that in the absence of convexity all bets are off. The reader should note that twice in the first paragraph ``$|\delta\Omega|$'' appears in error, where ``$\overline\Omega$'' was apparently intended.
[Robert Dawson (Halifax)]
MSC 2000:
*52A40 Geometric inequalities, etc. (convex geometry)
49Q20 Variational problems in geometric measure-theoretic setting
28A75 Geometric measure theory

Keywords: Cheeger set; computational geometry; convex set; plane; algorithm

Cited in: Zbl 1167.52005

Login Username: Password:

Highlights
Scientific prize winners of the ICM 2010
Overhang
Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Master Server

Zentralblatt MATH Berlin [Germany]

© FIZ Karlsruhe GmbH

Zentralblatt MATH master server is maintained by the Editorial Office in Berlin, Section Mathematics and Computer Science of FIZ Karlsruhe and is updated daily.

Other Mirror Sites



Copyright © 2013 Zentralblatt MATH | European Mathematical Society | FIZ Karlsruhe | Heidelberg Academy of Sciences
Published by Springer-Verlag | Webmaster