Related papers: Maximal Volume Ideal Polyhedra and the Arithmetic …

Let $S$ be a set of $n$ points in $\mathbb{R}^d$. A Steiner convex partition is a tiling of ${\rm conv}(S)$ with empty convex bodies. For every integer $d$, we show that $S$ admits a Steiner convex partition with at most $\lceil…

If a hyperbolic link has a prime alternating diagram D, then we show that the link complement's volume can be estimated directly from D. We define a very elementary invariant of the diagram D, its twist number t(D), and show that the volume…

We prove the convex combination theorem for hyperbolic n-manifolds. Applications are given both in high dimensions and in 3 dimensions. One consequence is that given two geometrically finite subgroups of a discrete group of isometries of…

We give a unified description of tetrahedra with lightlike faces in 3d anti-de Sitter, de Sitter and Minkowski spaces and of their duals in 3d anti-de Sitter, hyperbolic and half-pipe spaces. We show that both types of tetrahedra are…

We study the restricted volume of effective divisors, its properties and the relationship with the related notion of reduced volume, defined via multiplier ideals, and with the asymptotic intersection number. We build upon the fundamental…

We define the ideal simplicial volume for compact manifolds with boundary. Roughly speaking, the ideal simplicial volume of a manifold $M$ measures the minimal size of possibly ideal triangulations of $M$ "with real coefficients", thus…

We prove that the metric balls of a Hilbert geometry admit a volume growth at least polynomial of degree their dimension. We also characterise the convex polytopes as those having exactly polynomial volume growth of degree their dimension.

Given the fundamental group $\Gamma$ of a finite-volume complete hyperbolic $3$-manifold $M$, it is possible to associate to any representation $\rho:\Gamma \rightarrow \text{Isom}(\mathbb{H}^3)$ a numerical invariant called volume. This…

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…

Let $P$ be a convex polyhedron and $Q$ be a convex polygon with $n$ vertices in total in three-dimensional space. We present a deterministic algorithm that finds a translation vector $v \in \mathbb{R}^3$ maximizing the overlap area $|P \cap…

We consider random polytopes in the $d$-dimensional Euclidean space that are the convex hulls i.i.d. random points selected according to beta-prime distributions. These distributions are rotationally symmetric, heavy-tailed, and their…

Inverse optimization, determining parameters of an optimization problem that render a given solution optimal, has received increasing attention in recent years. While significant inverse optimization literature exists for convex…

Volume approximation is an important problem found in many applications of computer graphics, vision, and image processing. The problem is about computing an accurate and compact approximate representation of 3D volumes using some simple…

Let $B$ be a set of $n$ axis-parallel boxes in $\mathbb{R}^d$ such that each box has a corner at the origin and the other corner in the positive quadrant of $\mathbb{R}^d$, and let $k$ be a positive integer. We study the problem of…

We introduce polyhedra circuits. Each polyhedra circuit characterizes a geometric region in $\mathbb{R}^d$. They can be applied to represent a rich class of geometric objects, which include all polyhedra and the union of a finite number of…

In this paper we consider the problem of minimizing the relative perimeter under a volume constraint in the interior of a conically bounded convex set, i.e., an unbounded convex body admitting an \emph{exterior} asymptotic cone. Results…

We consider the moments of the volume of the symmetric convex hull of independent random points in an $n$-dimensional symmetric convex body. We calculate explicitly the second and fourth moments for $n$ points when the given body is $B_q^n$…

The symmedian point of a triangle enjoys several geometric and optimality properties, which also serve to define it. We develop a new dynamical coordinatization of the symmedian, which naturally generalizes to other ideal hyperbolic…

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 investigate the problem of computing a minimal-volume container for the non-overlapping packing of a given set of three-dimensional convex objects. Already the simplest versions of the problem are NP-hard so that we cannot expect to find…