English
Related papers

Related papers: Minimum polyhedron with $n$ vertices

200 papers

We prove that the regular octahedron has the minimal surface area among 3-polytopes of given volume and having at most six vertices.

Metric Geometry · Mathematics 2019-01-09 Károly J. Böröczky , Ágnes Kovács

In the study of monostatic polyhedra, initiated by John H. Conway in 1966, the main question is to construct such an object with the minimal number of faces and vertices. By distinguishing between various material distributions and…

Metric Geometry · Mathematics 2023-04-17 Dávid Papp , Krisztina Regős , Gábor Domokos , Sándor Bozóki

We prove that every homogeneous convex polyhedron with only one unstable equilibrium (known as a mono-unstable convex polyhedron) has at least $7$ vertices. Although it has been long known that no mono-unstable tetrahedra exist, and…

Metric Geometry · Mathematics 2024-06-06 Sándor Bozóki , Gábor Domokos , Dávid Papp , Krisztina Regős

We show that there are a finite number of possible pictures for a surface in a tetrahedron with local index $n$. Combined with previous results, this establishes that any topologically minimal surface can be transformed into one with a…

Geometric Topology · Mathematics 2013-03-28 David Bachman

A 1957 conjecture by Zdzislaw Melzak, that the unit volume polyhedron with least edge length was a triangular right prism, with edge length $2^{2/3}3^{11/6}$. We present a variety of necessary local criteria for any minimizer. In the case…

Metric Geometry · Mathematics 2023-04-21 Ásgeir Valfells

Until recently, the simplest known flexible polyhedron was Steffen's polyhedron on nine vertices. However, in 2024, an embedded flexible polyhedron on eight vertices was announced. It attains the known lower bound for the number of…

Metric Geometry · Mathematics 2025-10-09 Elvar Atlason

We prove the theorem mentioned in the title, for ${\mathbb{R}}^n$, where $n \ge 3$. The case of the simplex was known previously. Also, the case $n=2$ was settled, but there the infimum was some well-defined function of the side lengths. We…

Differential Geometry · Mathematics 2017-07-28 N. V. Abrosimov , E. Makai, , A. D. Mednykh , Yu. G. Nikonorov , G. Rote

For a $d$-dimensional polytope with $v$ vertices, $d+1\le v\le2d$, we calculate precisely the minimum possible number of $m$-dimensional faces, when $m=1$ or $m\ge0.62d$. This confirms a conjecture of Gr\"unbaum, for these values of $m$.…

Combinatorics · Mathematics 2019-01-17 Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

We show that a topologically minimal disk in a tetrahedron with index $n$ is either a normal triangle, a normal quadrilateral, or a normal helicoid with boundary length 4(n+1). This mirrors geometric results of Colding and Minicozzi.

Geometric Topology · Mathematics 2012-10-18 David Bachman

We prove that, both in the hyperbolic and spherical 3-spaces, there exist nonconvex compact boundary-free polyhedral surfaces without selfintersections which admit nontrivial continuous deformations preserving all dihedral angles and study…

Metric Geometry · Mathematics 2014-09-10 Victor Alexandrov

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…

Metric Geometry · Mathematics 2007-05-23 Chaim Goodman-Strauss , John M Sullivan

We introduce a concept of minimality for Fano polygons. We show that, up to mutation, there are only finitely many Fano polygons with given singularity content, and give an algorithm to determine the mutation-equivalence classes of such…

Algebraic Geometry · Mathematics 2022-10-28 Alexander Kasprzyk , Benjamin Nill , Thomas Prince

We prove that, given a polyhedron $\mathcal P$ in $\mathbb{R}^3$, every point in $\mathbb R^3$ that does not see any vertex of $\mathcal P$ must see eight or more edges of $\mathcal P$, and this bound is tight. More generally, this remains…

Computational Geometry · Computer Science 2023-08-29 Csaba D. Tóth , Jorge Urrutia , Giovanni Viglietta

In this survey article, we are interested on minimal triangulations of closed pl manifolds. We present a brief survey on the works done in last 25 years on the following: (i) Finding the minimal number of vertices required to triangulate a…

Geometric Topology · Mathematics 2007-05-23 Basudeb Datta

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ć

A deflated polygon is a polygon with no visibility crossings. We answer a question posed by Devadoss et al. (2012) by presenting a polygon that cannot be deformed via continuous visibility-decreasing motion into a deflated polygon. We show…

Computational Geometry · Computer Science 2019-05-21 Prosenjit Bose , Vida Dujmović , Nima Hoda , Pat Morin

We provide a list of conjectured surface-area-minimizing n-hedral tiles of space for n from 4 to 14, previously known only for n equal to 5 or 6. We find the optimal "orientation-preserving" tetrahedral tile (n=4), and we give a nice proof…

Metric Geometry · Mathematics 2013-05-08 Whan Ghang , Zane Martin , Steven Waruhiu

This paper presents a novel space-filling polyhedron (SFPH), here named the Josehedron, derived from the extremal points of the Fischer-Koch S triply periodic minimal surface (TPMS). The Josehedron is a plesiohedron with 12 faces (4…

Computational Geometry · Computer Science 2026-04-09 Mathias Bernhard

The space of shapes of a polyhedron with given total angles less than 2\pi at each of its n vertices has a Kaehler metric, locally isometric to complex hyperbolic space CH^{n-3}. The metric is not complete: collisions between vertices take…

Geometric Topology · Mathematics 2007-05-23 William P. Thurston

Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the same combinatorial structure as convex polyhedra. In…

Computational Geometry · Computer Science 2007-05-23 Marshall Bern , Erik D. Demaine , David Eppstein , Eric Kuo , Andrea Mantler , Jack Snoeyink
‹ Prev 1 2 3 10 Next ›