English
Related papers

Related papers: Deltahedral Domes over Equiangular Polygons

200 papers

We show that a realization of a closed connected PL-manifold of dimension n-1 in n-dimensional Euclidean space (n>2) is the boundary of a convex polyhedron (finite or infinite) if and only if the interior of each (n-3)-face has a point,…

Computational Geometry · Computer Science 2007-05-23 Konstantin Rybnikov

In this note we investigate the convex hull of those $n \times n$-permutation matrices that correspond to symmetries of a regular $n$-gon. We give the complete facet description. As an application, we show that this yields a Gorenstein…

Combinatorics · Mathematics 2012-12-19 Barbara Baumeister , Christian Haase , Benjamin Nill , Andreas Paffenholz

A convex pentagonal tile is a convex pentagon that admits a monohedral tiling. We show that a convex pentagonal tile that admits a periodic tiling has a property in which the sum of three internal angles of the pentagon is equal to…

Metric Geometry · Mathematics 2018-11-07 Teruhisa Sugimoto

Let $P$ be a simplicial smooth Fano polytope. We provide a concrete unimodular triangulation of $P$. We prove that the delta-vector of a simplicial smooth Fano polytope is unimodal and we give upper and lower bound for the volume of…

Combinatorics · Mathematics 2026-05-05 Gábor Hegedüs

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…

Metric Geometry · Mathematics 2016-01-14 Sarah-Marie Belcastro , Thomas C. Hull

It is well-known that the convex and concave envelope of a multilinear polynomial over a box are polyhedral functions. Exponential-sized extended and projected formulations for these envelopes are also known. We consider the convexification…

Optimization and Control · Mathematics 2021-06-14 Yibo Xu , Warren Adams , Akshay Gupte

We show that every heptagon is a section of a $3$-polytope with $6$ vertices. This implies that every $n$-gon with $n\geq 7$ can be obtained as a section of a $(2+\lfloor\frac{n}{7}\rfloor)$-dimensional polytope with at most…

Metric Geometry · Mathematics 2015-02-11 Arnau Padrol , Julian Pfeifle

In this work, we show the geometric properties of a family of polyhedra obtained by folding a regular tetrahedron along regular triangular grids. Each polyhedron is identified by a pair of nonnegative integers. The polyhedron can be cut…

Computational Geometry · Computer Science 2019-12-04 Seri Nishimoto , Takashi Horiyama , Tomohiro Tachi

This paper deals with triangulations of the 2-torus with the vertex labeled general octahedral graph $O_4$ which is isomorphic to the complete four-partite graph $K_{2,2,2,2}$; it is known that there exist precisely twelve such…

Combinatorics · Mathematics 2022-04-25 Serge Lawrencenko , Alex Lao

One can define what it means for a compact manifold with corners to be a "contractible manifold with contractible faces." Two combinatorially equivalent, contractible manifolds with contractible faces are diffeomorphic if and only if their…

Geometric Topology · Mathematics 2014-07-24 Michael W. Davis

A \textit{Reinhardt polygon} is a convex $n$-gon that, for $n$ not a power of $2$, is optimal in three different geometric optimization problems, for example, it has maximal perimeter relative to its diameter. Some such polygons exhibit a…

Metric Geometry · Mathematics 2014-10-28 Kevin G. Hare , Michael J. Mossinghoff

Generalized polyhedral convex sets, generalized polyhedral convex functions on locally convex Hausdorff topological vector spaces, and the related constructions such as sum of sets, sum of functions, directional derivative, infimal…

Optimization and Control · Mathematics 2017-05-22 Nguyen Ngoc Luan , Jen-Chih Yao , Nguyen Dong Yen

Compact polyhedra of cubic point symmetry Oh, exhibit surfaces of planar sections (facets) characterized by normal vector families {abc} with up to 48 members each, compatible with Oh symmetry. We focus first on polyhedra confined by facets…

Atomic and Molecular Clusters · Physics 2022-09-20 KLaus E. Hermann

We study the dissection of a square into congruent convex polygons. Yuan \emph{et al.} [Dissecting the square into five congruent parts, Discrete Math. \textbf{339} (2016) 288-298] asked whether, if the number of tiles is a prime number…

Combinatorics · Mathematics 2023-06-22 Hui Rao , Lei Ren , Yang Wang

We study a polyhedron with $n$ vertices of fixed volume having minimum surface area. Completing the proof of Fejes Toth, we show that all faces of a minimum polyhedron are triangles, and further prove that a minimum polyhedron does not…

Metric Geometry · Mathematics 2020-12-21 Shigeki Akiyama

Let $\Poly$ be a simple polygon with $n$ vertices. The \emph{dual graph} $\triang^*$ of a triangulation~$\triang$ of~$\Poly$ is the graph whose vertices correspond to the bounded faces of $\triang$ and whose edges connect those faces…

Computational Geometry · Computer Science 2017-10-31 Matias Korman , Stefan Langerman , Wolfgang Mulzer , Alexander Pilz , Maria Saumell , Birgit Vogtenhuber

Given a planar straight-line graph $G=(V,E)$ in $\mathbb{R}^2$, a \emph{circumscribing polygon} of $G$ is a simple polygon $P$ whose vertex set is $V$, and every edge in $E$ is either an edge or an internal diagonal of $P$. A circumscribing…

Computational Geometry · Computer Science 2021-06-30 Hugo A. Akitaya , Matias Korman , Oliver Korten , Mikhail Rudoy , Diane L. Souvaine , Csaba D. Tóth

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 classify the dihedral edge-to-edge tilings of the sphere by regular polygons with gonality at least 5 and rhombi.

Combinatorics · Mathematics 2024-03-13 Ho Man Cheung , Hoi Ping Luk

A hinged dissection of a set of polygons S is a collection of polygonal pieces hinged together at vertices that can be folded into any member of S. We present a hinged dissection of all edge-to-edge gluings of n congruent copies of a…

Computational Geometry · Computer Science 2007-05-23 Erik D. Demaine , Martin L. Demaine , David Eppstein , Greg N. Frederickson , Erich Friedman