English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this note we investigate a problem formulated by Pleijel in 1955. It asks for the cone over a convex plane domain  having minimal surface among all cones over  with the same given height  h . For cones based on reflection symmetric polygonal  we analyze the behaviour, as  h  → 0 and as  h  → ∞, of the position of the apex for the minimizing cone and characterize the coordinate of the limit points by necessary conditions. Furthermore, the question whether there are convex domains such that the minimal cone does not change with  h  is discussed. The results about the location of the optimal point in the limits  h  → ∞ and  h  → 0 presented here give the more or less explicit algebraic coordinates of the optimal apex. A complete (but implicit) characterization of this point was given by B. Cheng in [Cheng B. N.: On a problem of A. Pleijel. Geom. Dedicata  44  (1992), 139–145].

Cones based on reflection symmetric convex polygons: Remarks on a problem by A. Pleijel