Related papers: Polyhedron under Linear Transformations
We introduce a linear algebraic object called a bidiagonal triple. A bidiagonal triple consists of three diagonalizable linear transformations on a finite-dimensional vector space, each of which acts in a bidiagonal fashion on the…
Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure as well as for practical polyhedral computations. In this note, we study symmetry groups preserving the linear, projective and combinatorial…
A polyhedron is a graph $G$ which is simple, planar and 3-connected. In this note, we classify the family of strongly involutive self-dual polyhedra. The latter is done by using a well-known result due to Tutte characterizing 3-connected…
For given finite system of convex polygons in the plane which have no transversal, find such homothety transformations of polygons (having fixed centres inside given polygons) with minimal similarity ratio c>1 that the transformed system…
We consider whether any two triangulations of a polygon or a point set on a non-planar surface with a given metric can be transformed into each other by a sequence of edge flips. The answer is negative in general with some remarkable…
An approximation result for the bilinear Hilbert transform is proved and used for the inversion of the bilinear Hilbert transform. Also, p-Lebesgue points $(p\geq 1)$ are analyzed.
The image of a linear space under inversion of some coordinates is an affine variety whose structure is governed by an underlying hyperplane arrangement. In this paper, we generalize work by Proudfoot and Speyer to show that circuit…
A cubic polyhedron is a polyhedral surface whose edges are exactly all the edges of the cubic lattice. Every such polyhedron is a discrete minimal surface, and it appears that many (but not all) of them can be relaxed to smooth minimal…
A convex polyhedron $P$ is $k$-equiprojective if all of its orthogonal projections, i.e., shadows, except those parallel to the faces of $P$ are $k$-gon for some fixed value of $k$. Since 1968, it is an open problem to construct all…
In this paper, a geometric interpretation is provided of a new rational Landen transformation. The convergence of its iterates is also established.
A permutation polytope is the convex hull of a group of permutation matrices. In this paper we investigate the combinatorics of permutation polytopes and their faces. As applications we completely classify permutation polytopes in…
Polypolyhedra (after R. Lang) are compounds of edge-transitive 1-skeleta. There are 54 topologically different polypolyhedra, and each has icosidodecahedral, cuboctahedral, or tetrahedral symmetry, all are realizable as modular origami…
We give a short proof of a result obtained by Mohammad Ghomi concerning existence of nets of a convex polyhedron after a suitable linear transformation.
By taking quotients of a certain tiling of hyperbolic plane / space by certain group actions, we obtain geometric polyhedra / cellulations with interesting symmetries and incidence structure.
In this work we prove constructively that the complement $\R^n\setminus\pol$ of a convex polyhedron $\pol\subset\R^n$ and the complement $\R^n\setminus\Int(\pol)$ of its interior are regular images of $\R^n$. If $\pol$ is moreover bounded,…
As part of our study of the $q$-tetrahedron algebra $\boxtimes_q$ we introduce the notion of a $q$-inverting pair. Roughly speaking, this is a pair of invertible semisimple linear transformations on a finite-dimensional vector space, each…
For a polygon in Euclidean space we consider a transformation T which is obtained by applying the midpoints polygon construction twice and using an index shift. For a closed polygon this is a curve shortening process. A polygon is called…
It is shown that every orthogonal terrain, i.e., an orthogonal (right-angled) polyhedron based on a rectangle that meets every vertical line in a segment, has a grid unfolding: its surface may be unfolded to a single non-overlapping piece…
A spectrahedron is a set defined by a linear matrix inequality. A projection of a spectrahedron is often called a semidefinitely representable set. We show that the convex hull of a finite union of such projections is again a projection of…
We consider the inverse problem of the broken ray transform (sometimes also referred to as the V-line transform). Explicit image reconstruction formulas are derived and tested numerically. The obtained formulas are generalizations of the…