English
Related papers

Related papers: Minimum polyhedron with $n$ vertices

200 papers

In (the surface of) a convex polytope P^n in R^n+1, for small prescribed volume, geodesic balls about some vertex minimize perimeter. This revision corrects a mistake in the mass bound argument in the proof of Theorem 3.8.

Metric Geometry · Mathematics 2007-05-23 Frank Morgan

E. Calabi and J. Cao showed that a closed geodesic of least length in a two-sphere with nonnegative curvature is always simple. Using min-max theory, we prove that for some higher dimensions, this result holds without assumptions on the…

Differential Geometry · Mathematics 2016-12-08 Antoine Song

We prove there exists a compact embedded minimal surface in a complete finite volume hyperbolic $3$-manifold $\mathcal{N}$. We also obtain a least area, incompressible, properly embedded, finite topology, $2$-sided surface. We prove a…

Differential Geometry · Mathematics 2014-06-26 Pascal Collin , Laurent Hauswirth , Laurent Mazet , Harold Rosenberg

We show that the size of a minimal simplicial cover of a polytope $P$ is a lower bound for the size of a minimal triangulation of $P$, including ones with extra vertices. We then use this fact to study minimal triangulations of cubes, and…

Combinatorics · Mathematics 2007-05-23 Adam Bliss , Francis Edward Su

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

The monostatic property of convex polyhedra (i.e. the property of having just one stable or unstable static equilibrium point) has been in the focus of research ever since Conway and Guy published the proof of the existence of the first…

Metric Geometry · Mathematics 2021-10-22 Sándor Bozóki , Gábor Domokos , Flórián Kovács , Krisztina Regős

We prove that if an $n$-dimensional space $X$ satisfies certain topological conditions then any triangulation of $X$ as well as any its representation as a simplicial set with contractible faces has at least $2^n$ faces of dimension $n$.…

Algebraic Topology · Mathematics 2024-08-07 Sergey Avvakumov , Roman Karasev

We show that in any triangulated 3-manifold, every index n topologically minimal surface can be transformed to a surface which has local indices (as computed in each tetrahedron) that sum to at most n. This generalizes classical theorems of…

Geometric Topology · Mathematics 2012-10-18 David Bachman

We prove that every stationary polyhedral varifold minimizes area in the following senses: (1) its area cannot be decreased by a one-to-one Lipschitz ambient deformation that coincides with the identity outside of a compact set, and (2) it…

Differential Geometry · Mathematics 2020-01-14 Brian White

Minimal surfaces are ubiquitous in nature. Here they are considered as geometric objects that bear a deformation content. By refining the resolution of the surface deformation gradient afforded by the polar decomposition theorem, we…

Differential Geometry · Mathematics 2024-08-13 André M. Sonnet , Epifanio G. Virga

We show an explicit construction in 3 dimensions for a convex, mono-monostatic polyhedron (i.e., having exactly one stable and one unstable equilibrium) with 21 vertices and 21 faces. This polyhedron is a 0-skeleton, with equal masses…

Metric Geometry · Mathematics 2022-08-10 Gábor Domokos , Flórián Kovács

Given a closed polygon P having n edges, embedded in R^d, we give upper and lower bounds for the minimal number of triangles t needed to form a triangulated PL surface in R^d having P as its geometric boundary. The most interesting case is…

Geometric Topology · Mathematics 2007-05-23 Joel Hass , Jeffrey C. Lagarias

We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have…

Computational Geometry · Computer Science 2010-01-21 Erik D. Demaine , David Eppstein , Jeff Erickson , George W. Hart , Joseph O'Rourke

We give coordinate-minimal geometric realizations in general position of all 865 vertex-minimal triangulations of the orientable surface of genus 2 in the 4x4x4-cube.

Metric Geometry · Mathematics 2007-05-23 Stefan Hougardy , Frank H. Lutz , Mariano Zelke

We prove that the least-perimeter partition of the sphere into four regions of equal area is a tetrahedral partition.

Differential Geometry · Mathematics 2009-06-19 Max Engelstein

We study oriented connected closed polyhedral surfaces with non-degenerate triangular faces in three-dimensional Euclidean space, calling them polyhedra for short. A polyhedron is called flexible if its spatial shape can be changed…

Metric Geometry · Mathematics 2020-06-08 Victor Alexandrov

We show that no minimal vertex triangulation of a closed, connected, orientable 2-manifold of genus 6 admits a polyhedral embedding in R^3. We also provide examples of minimal vertex triangulations of closed, connected, orientable…

Metric Geometry · Mathematics 2008-01-18 Lars Schewe

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

We investigate complete non-orientable minimal surfaces of finite total curvature in $\mathbb{R}^3$ such that their ends are foliated by closed lines of curvature. This condition on the ends is necessary if they have a piece inside some…

Differential Geometry · Mathematics 2026-05-12 Carlos Andrés Toro Cardona

It is well-known that every isosceles tetrahedron (disphenoid) admits infinitely many simple closed geodesics on its surface. They can be naturally enumerated by pairs of co-prime integers $n > m > 1$ with two additional cases $(1,0)$ and…

Metric Geometry · Mathematics 2023-12-19 Vladimir Yu. Protasov