Related papers: Archimedes' Revenge
We provide formulas and algorithms for computing the excess numbers of certain ideals. The solution for monomial ideals is given by the mixed volumes of certain polytopes. These results enable us to design specific homotopies for numerical…
We give a method for computing upper and lower bounds for the volume of a non-obtuse hyperbolic polyhedron in terms of the combinatorics of the 1-skeleton. We introduce an algorithm that detects the geometric decomposition of good…
We have derived an analytical formulation for estimating the volume of geometries enclosed by implicitly defined surfaces. The novelty of this work is due to two aspects. First we provide a general analytical formulation for all…
We give a deterministic method of quasi-polynomial complexity to approximate the volume of the intersection of the unit hypercube with two specific sets. The method can actually be applied (without losing the quasi-polynomial complexity) to…
We provide a formula to compute the volume of the intersection of a generalized cylinder with a hyperplane. Then we prove an integral inequality involving Bessel functions similar to Keith Ball's well-known inequality. Using this inequality…
The intersection of two orthogonal cylinders represents a classical problem in computational geometry with direct applications to engineering design, manufacturing, and numerical simulation. While analytical solutions exist for the fully…
The manuscript provides formulas for the volume of a body defined by the intersection of a solid cone and a solid sphere as a function of the sphere radius, of the distance between cone apex and sphere center, and of the cone aperture…
Speakman and Lee (2017) gave a formula for the volume of the convex hull of the graph of a trilinear monomial, $y=x_1x_2x_3$, over a box in the nonnegative orthant, in terms of the upper and lower bounds on the variables. This was done in…
Atkinson [2] found a sequence of three-dimensional hyperbolic polyhedra whose dihedral angles are $\pi /3$. In this paper, we construct another sequence of such polyhedra. We also determine the volumes of some of these polyhedra.
We consider a compact hyperbolic antiprism. It is a convex polyhedron with $2n$ vertices in the hyperbolic space $\mathbb{H}^3$. This polyhedron has a symmetry group $S_{2n}$ generated by a mirror-rotational symmetry of order $2n$, i.e.…
We consider the computation of the volume of the union of high-dimensional geometric objects. While showing that this problem is #P-hard already for very simple bodies (i.e., axis-parallel boxes), we give a fast FPRAS for all objects where…
By Andreev theorem acute-angled polyhedra of finite volume in a hyperbolic space $\mathbb H^{3}$ are uniquely determined by combinatorics of their 1-skeletons and dihedral angles. For a class of compact right-angled polyhedra and a class of…
Computing mixed volume of convex polytopes is an important problem in computational algebraic geometry. This paper establishes sufficient conditions under which the mixed volume of several convex polytopes exactly equals the normalized…
Using combinatorial methods, we derive several formulas for the volume of convex bodies obtained by intersecting a unit hypercube with a halfspace, or with a hyperplane of codimension 1, or with a flat defined by two parallel hyperplanes.…
We overview the volume calculations for polyhedra in Euclidean, spherical and hyperbolic spaces. We prove the Sforza formula for the volume of an arbitrary tetrahedron in $H^3$ and $S^3$. We also present some results, which provide a…
We present a software suite for the analysis and optimization of ideal convex polyhedra in hyperbolic 3-space $\mathbb{H}^3$. Using Rivin's variational characterization of ideal polyhedra, we develop efficient algorithms for checking…
We compare the volume of a hyperbolic 3-manifold $M$ of finite volume and the complexity of its fundamental group.
Considering a finite intersection of balls and a finite union of other balls in an Euclidean space, we propose an exact method to test whether the intersection is covered by the union. We reformulate this problem into quadratic programming…
For a compact right-angled polyhedron $R$ in $\mathbb H^3$ denote by $\operatorname{vol} (R)$ the volume and by $\operatorname{vert} (R)$ the number of vertices. Upper and lower bounds for $\operatorname{vol} (R)$ in terms of…
In this paper we study the systoles of arithmetic hyperbolic 2- and 3-manifolds. Our first result is the construction of infinitely many arithmetic hyperbolic 2- and 3-manifolds which are pairwise noncommensurable, all have the same…