English
Related papers

Related papers: Unfolding Polyhedra

200 papers

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…

Computational Geometry · Computer Science 2010-09-14 Masud Hasan , Mohammad Monoar Hossain , Alejandro López-Ortiz , Sabrina Nusrat , Saad Altaful Quader , Nabila Rahman

Skeletal polyhedra and polygonal complexes in ordinary Euclidean 3-space are finite or infinite 3-periodic structures with interesting geometric, combinatorial, and algebraic properties. They can be viewed as finite or infinite 3-periodic…

Metric Geometry · Mathematics 2014-03-04 Egon Schulte

Predicting the large-amplitude deformations of thin elastic sheets is difficult due to the complications of self-contact, geometric nonlinearities, and a multitude of low-lying energy states. We study a simple two-dimensional setting where…

We study the shape of inflated surfaces introduced in \cite{B1} and \cite{P1}. More precisely, we analyze profiles of surfaces obtained by inflating a convex polyhedron, or more generally an almost everywhere flat surface, with a symmetry…

Differential Geometry · Mathematics 2015-05-13 Igor Pak , Jean-Marc Schlenker

A well-known result in the study of convex polyhedra, due to Minkowski, is that a convex polyhedron is uniquely determined (up to translation) by the directions and areas of its faces. The theorem guarantees existence of the polyhedron…

Computational Geometry · Computer Science 2017-12-06 Giuseppe Sellaroli

Partial generalizations of virtual polyhedra theory (sometimes under different names) appeared recently in the theory of torus manifolds. These generalizations look very different from the original virtual polyhedra theory. They are based…

Algebraic Geometry · Mathematics 2022-10-04 Askol dKhovanskii

Using the orthogonal connectedness, we introduce the notion of orthogonal decomposability of convex polytopes and study it in the case of Platonic and Archimedean solids. While doing so, we also encounter polytopes which are not…

Combinatorics · Mathematics 2026-03-10 Julia Q. Du , Xuemei He , Xiaotian Song , Daniela Stiller , Liping Yuan , Tudor Zamfirescu

We describe a characterization of convex polyhedra in $\h^3$ in terms of their dihedral angles, developed by Rivin. We also describe some geometric and combinatorial consequences of that theory. One of these consequences is a combinatorial…

Metric Geometry · Mathematics 2016-09-06 Craig D. Hodgson , Igor Rivin , Warren D. Smith

We continue the study of open associahedra associated with bi-color scattering amplitudes initiated in arXiv:1912.08307. We focus on the facet geometries of the open associahedra, uncovering many new phenomena such as fiber-product…

High Energy Physics - Theory · Physics 2020-12-23 Aidan Herderschee , Fei Teng

In this survey paper, we present open problems and conjectures on visibility graphs of points, segments and polygons along with necessary backgrounds for understanding them.

Computational Geometry · Computer Science 2015-03-17 Subir Kumar Ghosh , Partha Pratim Goswami

A polyiamond is a polygon composed of unit equilateral triangles, and a generalized deltahedron is a convex polyhedron whose every face is a convex polyiamond. We study a variant where one face may be an exception. For a convex polygon P,…

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…

Metric Geometry · Mathematics 2019-02-08 Milica Stojanović

We prove that every three-dimensional polyhedron is uniquely determined by its dihedral angles and edge lengths, even if nonconvex or self-intersecting, under two plausible sufficient conditions: (i) the polyhedron has only convex faces and…

Geometric Topology · Mathematics 2023-07-28 Yunhi Cho , Seonhwa Kim

Deep learning has received much attention lately due to the impressive empirical performance achieved by training algorithms. Consequently, a need for a better theoretical understanding of these problems has become more evident in recent…

Machine Learning · Computer Science 2022-03-03 Daniel Bienstock , Gonzalo Muñoz , Sebastian Pokutta

The image and the inverse image of a polyhedron under a linear transformation are polyhedrons.

Functional Analysis · Mathematics 2012-02-01 Zaikun Zhang

We present a notion of mutation of hyperbolic polyhedra, analogous to mutation in knot theory, and then present a general question about commensurability of mutant pairs of polyhedra. We motivate that question with several concrete examples…

Geometric Topology · Mathematics 2019-06-21 Croix Gyurek , Roland Roeder

A number of unsolved problems and open questions about the nature and the properties of supernovae are identified and briefly discussed. Some suggestions and directions toward possible solutions are also considered.

Solar and Stellar Astrophysics · Physics 2015-05-13 Nino Panagia

We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…

Algebraic Geometry · Mathematics 2025-10-20 J. Maurice Rojas

In this article we review some problems in physics, chemistry and mathematics that lead naturally to a class of polyhedra which include the Platonic solids. Examples include the study of electrons on a sphere, cages of carbon atoms, central…

Mathematical Physics · Physics 2007-05-23 Michael Atiyah , Paul Sutcliffe

We tackle the Art Gallery Problem and the Searchlight Scheduling Problem in 3-dimensional polyhedral environments, putting special emphasis on edge guards and orthogonal polyhedra.

Computational Geometry · Computer Science 2012-11-13 Giovanni Viglietta
‹ Prev 1 4 5 6 7 8 10 Next ›