Related papers: On the solid angle of a convex set
The classical Crofton formula explains how intrinsic volumes of a convex body $K$ in $n$-dimensional Euclidean space can be obtained from integrating a measurement function at sections of $K$ with invariantly moved affine flats. Motivated…
Cauchy's surface area formula says that for a convex body $K$ in $n$-dimensional Euclidean space the mean value of the $(n-1)$-dimensional volumes of the orthogonal projections of $K$ to hyperplanes is a constant multiple of the surface…
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…
For given convex set $K$ in the plane (not necessarily bounded), we can construct the curve $C$ for which the visibility (aperture) angle of this set has the same, prescribed value. We give the implicit formula for $C$, discuss some issues…
A set in the Euclidean plane is said to be biconvex if, for some angle $\theta\in[0,\pi/2)$, all its sections along straight lines with inclination angles $\theta$ and $\theta+\pi/2$ are convex sets (i.e, empty sets or segments).…
Motivated by applications in geomorphology, the aim of this paper is to extend Morse-Smale theory from smooth functions to the radial distance function (measured from an internal point), defining a convex polyhedron in 3-dimensional…
We consider the set of points chosen randomly, independently and uniformly in the $d$-dimensional spherical layer. A set of points is called $1$-convex if all its points are vertices of the convex hull of this set. In \cite{3} an estimate…
This paper addresses the numerical computation of critical angles between two convex cones in finite-dimensional Euclidean spaces. We present a novel approach to computing these critical angles by reducing the problem to finding stationary…
The article reviews some of the (fairly scattered) information available in the mathematical literature on the subject of angles in complex vector spaces. The following angles and their relations are considered: Euclidean, complex, and…
Consider a random $d$-dimensional simplex whose vertices are $d+1$ random points sampled independently and uniformly from the unit sphere in $\mathbb R^d$. We show that the expected sum of solid angles at the vertices of this random simplex…
For a compact convex set F in R^n, with the origin in its interior, we present a formula to compute the curvature at a fixed point on its boundary, in the direction of any tangent vector. This formula is equivalent to the existing ones, but…
An equidistant polytope is a special equidistant set in the space $\mathbb{R}^n$ all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in…
The classical perspective of a function is a construction which transforms a convex function into one that is jointly convex with respect to an auxiliary scaling variable. Motivated by applications in several areas of applied analysis, we…
We revisit the gravitational lensing phenomenon using a new visualization technique. It consists in projecting the observers sky into the source plane, what gives rise to a folded and stretched surface. This provides a clear graphical tool…
This work proposes a new formulation to the long-standing problem of convex decomposition through learning feature fields, enabling the first feed-forward model for open-world convex decomposition. Our method produces high-quality…
In the present paper, classical tools of convex analysis are used to study the solution set to a certain class of set-inclusive generalized equations. A condition for the solution existence and global error bounds is established, in the…
Convex sets appear in various mathematical theories, and are used to define notions such as convex functions and hulls. As an abstraction from the usual definition of convex sets in vector spaces, we formalize in Coq an intrinsic…
Convex support, the mean values of a set of random variables, is central in information theory and statistics. Equally central in quantum information theory are mean values of a set of observables in a finite-dimensional C*-algebra A, which…
This paper presents a selected tour through the theory and applications of lifts of convex sets. A lift of a convex set is a higher-dimensional convex set that projects onto the original set. Many convex sets have lifts that are…
Given an Euclidean space, this paper elucidates the topological link between the partial derivatives of the Minkowski functional associated to a set (assumed to be compact, convex, with a differentiable boundary and a non-empty interior)…