Related papers: Volume computation for Meissner polyhedra and appl…
The dodecahedral conjecture states that the volume of the Voronoi polyhedron of a sphere in a packing of equal spheres is at least the volume of a regular dodecahedron with inradius 1. The authors prove the conjecture following the…
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…
In 1996 I.Kh. Sabitov proved that the volume of a simplicial polyhedron in a 3-dimensional Euclidean space is a root of certain polynomial with coefficients depending on the combinatorial type and on edge lengths of the polyhedron only.…
We establish the second part of Milnor's conjecture on the volume of simplexes in hyperbolic and spherical spaces. A characterization of the closure of the space of the angle Gram matrices of simplexes is also obtained.
We give a closed formula for volumes of generic hyperbolic tetrahedra in terms of edge lengths. The cue of our formula is by the volume conjecture for the Turaev-Viro invariant of closed 3-manifolds, which is defined from the quantum…
The signed volume function for polyhedra can be generalized to a mean volume function for volume elements by averaging over the triangulations of the underlying polyhedron. If we consider these up to translation and scaling, the resulting…
Volume computation for $d$-polytopes $\mathcal{P}$ is fundamental in mathematics. There are known volume computation algorithms, mostly based on triangulation or signed-decomposition of $\mathcal{P}$. We consider $…
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…
Let X be a closed manifold of dimension 2m >= 6 with torsion-free middle-dimensional homology. We construct metrics on X of arbitrarily small volume, such that every middle-dimensional submanifold of less than unit volume necessarily…
The Mahler measure of the polynomials $t(x^m-1) y - (x^n-1) \in \dC[x,y]$ is essentially the sum of volumes of a certain collection of ideal hyperbolic polyhedra in $\HH^3$, which can be determined a priori as a function on the parameter…
The aim of this note is to investigate isoperimetric-type problems for $3$-dimensional parallelohedra; that is, for convex polyhedra whose translates tile the $3$-dimensional Euclidean space. Our main result states that among…
Although shape correspondence is a central problem in geometry processing, most methods for this task apply only to two-dimensional surfaces. The neglected task of volumetric correspondence--a natural extension relevant to shapes extracted…
The study of the combinatorial diameter of a polyhedron is a classical topic in linear-programming theory due to its close connection with the possibility of a polynomial simplex-method pivot rule. The 2-sum operation is a classical…
Motivated by conjectures of Mahler and Makai Jr., we study bounds on the volume of a convex body in terms of the successive minima of its polar body.
We consider the problem of enumerating integer tetrahedra of fixed perimeter (sum of side-lengths) and/or diameter (maximum side-length), up to congruence. As we will see, this problem is considerably more difficult than the corresponding…
An equiangular hyperbolic Coxeter polyhedron is a hyperbolic polyhedron where all dihedral angles are equal to \pi/n for some fixed integer n at least 2. It is a consequence of Andreev's theorem that either n=3 and the polyhedron has all…
We use the theory of calibrations to write the equation of a minimal volume vector field on a given Riemann surface.
Volume entropy is an important invariant of metric graphs as well as Riemannian manifolds. In this note, we calculate the change of volume entropy when an edge is added to a metric graph. Using the first result, we investigate the change of…
The study of the additive volume of sets can be reduced to the case of one-dimensional sets. The exact values of the volume of extremal sets are given as a conjecture.
Volume estimates of metric balls in manifolds find diverse applications in information and coding theory. In this paper, some new results for the volume of a metric ball in unitary group are derived via various tools from random matrix…