Related papers: Reconstruction of Convex Bodies from Projection Cu…
X-ray tomography has been studied in various fields. Although a great deal of effort has been directed at reconstructing the projection image set from a rigid-type specimen, little attention has been addressed to the reconstruction of…
In this short note, we show that the inradius of a convex body is comparable to its volume divided by its surface area. We also give a simple formula, in terms of its volume and inradius, that is comparable to the volume of its intersection…
We disprove a conjecture of A. Koldobsky asking whether it is enough to compare $(n-2)$-derivatives of the projection functions of two symmetric convex bodies in the Shephard problem in order to get a positive answer in all dimensions.
Convexity prior is one of the main cue for human vision and shape completion with important applications in image processing, computer vision. This paper focuses on characterization methods for convex objects and applications in image…
In the Onsager model of one-component hard-particle systems, the entire phase behaviour is dictated by a function of relative orientation, which represents the amount of space excluded to one particle by another at this relative…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
We study the motion of smooth, strictly convex bodies in $\mathbb{R}^n$ expanding in the direction of their normal vector field with speed depending on Gauss curvature and support function.
A key idea in convex optimization theory is to use well-structured affine functions to approximate general functions, leading to impactful developments in conjugate functions and convex duality theory. This raises the question: what are the…
We show that many well-known transforms in convex geometry (in particular, centroid body, convex floating body, and Ulam floating body) are special instances of a general construction, relying on applying sublinear expectations to random…
A well-known result in the study of convex polyhedra, due to Minkowski, is that a convex polyhedron is uniquely determined (up to translation) by the directions and areas of its faces. The theorem guarantees existence of the polyhedron…
This paper considers a conceptual version of a convex optimization algorithm whic is based on replacing a convex optimization problem with the root-finding problem for the approximate sub-differential mapping which is solved by repeated…
We prove that if two convex bodies $ K, L \subset \mathbb{R}^3$ satisfy the property that the orthogonal projections of $K$ and $L$ onto every plane containing the origin are roations of each other, then either $K$ and $L$ coincide or $L$…
A real projective orbifold is an $n$-dimensional orbifold modeled on $\mathbb{RP}^n$ with the group $PGL(n+1, \mathbb{R})$. We concentrate on an orbifold that contains a compact codimension $0$ submanifold whose complement is a union of…
Image reconstruction in X ray tomography consists in determining an object from its projections. In many applications such as non destructive testing, we look for an image who has a constant value inside a region (default) and another…
We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…
We consider the problem of reconstructing a full 360{\deg} photographic model of an object from a single image of it. We do so by fitting a neural radiance field to the image, but find this problem to be severely ill-posed. We thus take an…
A real projective orbifold has a radial end if a neighborhood of the end is foliated by projective geodesics that develop into geodesics ending at a common point. It has a totally geodesic end if the end can be completed to have the totally…
It is proved that every convex body in the plane has a point such that the union of the body and its image under reflection in the point is convex. If the body is not centrally symmetric, then it has, in fact, three affinely independent…
A representation of a finitely generated group into the projective general linear group is called convex co-compact if it has finite kernel and its image acts convex co-compactly on a properly convex domain in real projective space. We…
At a first glance, the problem of illuminating the boundary of a convex body by external light sources and the problem of covering a convex body by its smaller positive homothetic copies appear to be quite different. They are in fact two…