Related papers: PVC Polyhedra
The paper surveys highlights of the ongoing program to classify discrete polyhedral structures in Euclidean 3-space by distinguished transitivity properties of their symmetry groups, focussing in particular on various aspects of the…
Retaining the combinatorial Euclidean structure of a regular icosahedron, namely the 20 equiangular (planar) triangles, the 30 edges of length 1, and the 12 different vertices together with the incidence structure, we investigate variations…
I present a jaunty little $[[14, 3, 3]]$ non-CSS surface code that can be described using a rhombic dodecahedron. Do with it what you will.
We give a full classification of continuous flexible discrete axial cone-nets, which are called axial C-hedra. The obtained result can also be used to construct their semi-discrete analogs. Moreover, we identify a novel subclass within the…
We study convex polyhedra in three-space that are inscribed in a quadric surface. Up to projective transformations, there are three such surfaces: the sphere, the hyperboloid, and the cylinder. Our main result is that a planar graph…
A quasigeodesic is a curve on the surface of a convex polyhedron that has $\le \pi$ surface to each side at every point. In contrast, a geodesic has exactly $\pi$ to each side and so can never pass through a vertex, whereas quasigeodesics…
In this paper we consider the symmetries of triangulable half-dilation structures on the sphere with four singularities. We show that all such surfaces can be produced by a tetrahedral construction. Using this construction, we calculate…
A convex polyhedron is Rupert if a hole can be cut into it (making its genus $1$) such that an identical copy of the polyhedron can pass through the hole. Resolving a conjecture of Jerrard-Wetzel-Yuan, Steininger and Yurkevich recently…
Let X^{circ} be the space of all labeled tetrahedra in P^{3}. In [BGS] we constructed a smooth symmetric compactification X-tilde of X^{circ}. In this article we show that the complement X-tilde smallsetminus X^{circ} is a divisor with…
We give coordinate-minimal geometric realizations in general position for 17 of the 20 vertex-minimal triangulations of the orientable surface of genus 3 in the 5x5x5-cube.
In this paper, we establish that the non-zero dihedral angles of hyperbolic Coxeter polyhedra of large dimensions are not arbitrarily small. Namely, for dimensions $n\geq 32$, they are of the form $\frac{\pi}{m}$ with $m\leq 6$. Moreover,…
We consider polyhedral approximations of strictly convex compacta in finite dimensional Euclidean spaces (such compacta are also uniformly convex). We obtain the best possible estimates for errors of considered approximations in the…
We study the well-known problem of combinatorial classification of fullerenes. By a (mathematical) fullerene we mean a convex simple three dimensional polytope with all facets pentagons and hexagons. We analyse approaches of construction of…
We prove that the answer to the question of the title is `as many times as you want.' More precisely, given any constant $c>0$, we construct two oblique triangular bipyramids, $P$ and $Q$, such that $P$ is convex, $Q$ is nonconvex and…
The construction of an unbounded polyhedron from a "jagged'' convex cap is described, and several of its properties discussed, including its relation to Alexandrov's "limit angle."
Given a convex polyhedron $P$ of $n$ vertices inside a sphere $Q$, we give an $O(n^3)$-time algorithm that cuts $P$ out of $Q$ by using guillotine cuts and has cutting cost $O((\log n)^2)$ times the optimal.
In this note we consider the problem of manufacturing a convex polyhedral object via casting. We consider a generalization of the sand casting process where the object is manufactured by gluing together two identical faces of parts cast…
The orthogonal projection of a 4-cube onto a uniform random 3-subspace in R^4 is a convex 3-polyhedron P with 14 vertices almost surely. Three numerical characteristics of P -- volume, surface area and mean width -- are studied. These…
A completely well-centered tetrahedral mesh is a triangulation of a three dimensional domain in which every tetrahedron and every triangle contains its circumcenter in its interior. Such meshes have applications in scientific computing and…
It is well known that to determine a triangle up to congruence requires three measurements: three sides, two sides and the included angle, or one side and two angles. We consider various generalizations of this fact to two and three…