On the discrete logarithmic Minkowski problem in the plane
Metric Geometry
2026-01-21 v1
Abstract
The paper characterizes the convex hull of the closure of the cone-volume set , consisting of all cone-volume vectors of polygons with outer unit normals vectors contained in , for any finite set . We prove that this convex hull has finitely many extreme points by providing both a vertex representation as well as a half space representation. As a consequence, we derive new necessary conditions, which depend on , for the existence of solutions to the logarithmic Minkowski problem in .
Cite
@article{arxiv.2601.13159,
title = {On the discrete logarithmic Minkowski problem in the plane},
author = {Tom Baumbach},
journal= {arXiv preprint arXiv:2601.13159},
year = {2026}
}