相关论文: How many times can the volume of a convex polyhedr…
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…
The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex polyhedron, is infinitesimally rigid. We prove that it is indeed…
A polyhedron in a three-dimensional hyperbolic space is said to be generalized if finite, ideal and truncated vertices are admitted. In virtue of Belletti's theorem (2021) the exact upper bound for volumes of generalized hyperbolic…
In 1996 Sabitov proved that the volume of an arbitrary simplicial polyhedron P in the 3-dimensional Euclidean space $\R^3$ satisfies a monic (with respect to V) polynomial relation F(V,l)=0, where l denotes the set of the squares of edge…
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 investigate the folding problem that asks if a polygon P can be folded to a polyhedron Q for given P and Q. Recently, an efficient algorithm for this problem has been developed when Q is a box. We extend this idea to regular polyhedra,…
As was pointed out by Nikulin [8] and Vinberg [10], a right-angled polyhedron of finite volume in hyperbolic n-space $\mathbb{H}^n$ has at least one cusp for $n\geq 5$. We obtain non-trivial lower bounds on the number of cusps of such…
Any convex polytope whose combinatorial automorphism group has two orbits on the flags is isomorphic to one whose group of Euclidean symmetries has two orbits on the flags (equivalently, to one whose automorphism group and symmetry group…
Which convex 3D polyhedra can be obtained by gluing several regular hexagons edge-to-edge? It turns out that there are only 15 possible types of shapes, 5 of which are doubly-covered 2D polygons. We give examples for most of them, including…
We pose and answer several questions concerning the number of ways to fold a polygon to a polytope, and how many polytopes can be obtained from one polygon; and the analogous questions for unfolding polytopes to polygons. Our answers are,…
We discuss some recent results on flexible polyhedra and the bellows conjecture, which claims that the volume of any flexible polyhedron is constant during the flexion. Also, we survey main methods and several open problems in this area.
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.
Generalizing previous constructions, we present a dual pair of decompositions of the complement of a link L into bipyramids, given any multi-crossing projection of L. When L is hyperbolic, this gives new upper bounds on the volume of L…
The present paper considers volume formulae, as well as trigonometric identities, that hold for a tetrahedron in 3-dimensional spherical space of constant sectional curvature +1. The tetrahedron possesses a certain symmetry: namely rotation…
A convex polyhedron, that is, a compact convex subset of $\mathbb{R}^3$ which is the intersection of finitely many closed half-spaces, can be rectified by taking the convex hull of the midpoints of the edges of the polyhedron. We derive…
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…
It is known that we can always 3-triangulate (i.e. divide into tetrahedra) convex polyhedra but not always non-convex ones. Polyhedra topologically equivalent to sphere with $p$ handles, shortly $p$-toroids, could not be convex. So, it is…
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…
In this paper we obtain new upper bounds on volumes of right-angled polyhedra in hyperbolic space $\mathbb{H}^3$ in three different cases: for ideal polyhedra with all vertices on the ideal hyperbolic boundary, for compact polytopes with…
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…