Related papers: Maximizing Volume Ratios for Shadow Covering by Te…
Define the tet-volume of a triangulation of the 2-sphere to be the minimum number of tetrahedra in a 3-complex of which it is the boundary, and let $d(v)$ be the maximum tet-volume for $v$-vertex triangulations. In 1986 Sleator, Tarjan, and…
The Illumination Problem may be phrased as the problem of covering a convex body in Euclidean $n$-space by a minimum number of translates of its interior. By a probabilistic argument, we show that, arbitrarily close to the Euclidean ball,…
The work is devoted to the search for explicit isometric embeddings of a metric corresponding to the collapse of spherically symmetric matter with the formation of a black hole. Two approaches are considered: in the first, the embedding is…
Average distance between two points in a unit-volume body $K \subset \mathbb{R}^n$ tends to infinity as $n \to \infty$. However, for two small subsets of volume $\varepsilon > 0$ the situation is different. For unit-volume cubes and…
In this paper, we study the 3D strip packing problem in which we are given a list of 3-dimensional boxes and required to pack all of them into a 3-dimensional strip with length 1 and width 1 and unlimited height to minimize the height used.…
We study the problem of rotating a simple polygon to contain the maximum number of elements from a given point set in the plane. We consider variations of this problem where the rotation center is a given point or lies on a line segment, a…
We consider the problem of camouflaging for bodies with specular surface in the framework of geometric optics. The index of visibility introduced in [Plakhov 2017] measures the mean deviation of light rays incident on the body's surface. We…
In a human-robot collaborative task where a robot helps its partner by finding described objects, the depth dimension plays a critical role in successful task completion. Existing studies have mostly focused on comprehending the object…
We study properties of the volume of projections of the $n$-dimensional cross-polytope $\crosp^n = \{ x \in \R^n \mid |x_1| + \dots + |x_n| \leqslant 1\}.$ We prove that the projection of $\crosp^n$ onto a $k$-dimensional coordinate…
We present filling as a type of spatial subdivision problem similar to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most interior volume. In…
The mean width is a measure on three-dimensional convex bodies that enjoys equal status with volume and surface area [Rota]. As the phrase suggests, it is the mean of a probability density f. We verify formulas for mean widths of the…
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…
From a scalar field defined at the corner of a cube, an isosurface can be extracted using the Marching Cube algorithm. The isosurface separates the cell into two or more partial cells. A similar situation arises when an material interface…
The objective here is to find the maximum polygon, in area, which can be enclosed in a given triangle, for the polygons: parallelograms, rectangles and squares. It will initially be assumed that the choices are inscribed polygons, that is…
We obtain a new extension of Rogers-Shephard inequality providing an upper bound for the volume of the sum of two convex bodies $K$ and $L$. We also give lower bounds for the volume of the $k$-th limiting convolution body of two convex…
The present work surveys problems in $n$-dimensional space with $n$ large. Early development in the study of packing and covering in high dimensions was motivated by the geometry of numbers. Subsequent results, such as the discovery of the…
A reformulation of the three circles theorem of Johnson with distance coordinates to the vertices of a triangle is explicitly represented in a polynomial system and solved by symbolic computation. A similar polynomial system in distance…
Shadow art is a captivating form of sculptural expression where the projection of a sculpture in a specific direction reveals a desired shape with high precision. In this work, we introduce Neural Shadow Art, which leverages implicit…
A shadow of a geometric object $A$ in a given direction $v$ is the orthogonal projection of $A$ on the hyperplane orthogonal to $v$. We show that any topological embedding of a circle into Euclidean $d$-space can have at most two shadows…
The present paper regards the volume function of a doubly truncated hyperbolic tetrahedron. Starting from the previous results of J. Murakami, U. Yano and A. Ushijima, we have developed a unified approach to express the volume in different…