Dangling points in area-minimizing Meissner polyhedra
Beniamin Bogosel
Abstract
Meissner polyhedra are constant-width bodies obtained from extremal finite sets of unit diameter. Such a generating set may contain dangling points, namely points having exactly two diametric neighbors. This article studies whether these points can play an essential role in surface-area minimization. Given an extremal set we show that the smallest surface area among the Meissner polyhedra based on it cannot increase by deleting a dangling point. Adding a dangling point cannot decrease the smallest achievable surface area. This reduces the search for area-minimizing Meissner polyhedra to generating sets without dangling points.
Create a lesson
Related papers
Level-Set Geometry and the Theoretical Performance of PDHG for Conic Linear Optimization
Zikai Xiong, Robert M. Freund
Trajectory Manifolds for Nonlinear Data-Enabled Predictive Control
Arda Bayer
Optimizing Lyapunov Certificates via Stability-Preserving Quadratization for Polynomial Systems
Yubo Cai, Gioele Zardini
Regularity of a Multidimensional Principal-Agent Problem with Separable Effort Costs
Shuaijie Qian, Guan Qiao
Near-Optimal Exact-Value Zeroth-Order Complexity for Smooth Strongly Convex Optimization
Wendao Wu, Haihan Zhang, Chenheng Zhang et al.
A VU-calculus for composite functions and the U-Hessian of partly smooth functions
Shuai Liu