English
Related papers

Related papers: Which convex polyhedra can be made by gluing regul…

200 papers

If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…

Metric Geometry · Mathematics 2020-02-20 Lyle Ramshaw , James B. Saxe

The simplest way to generate a lattice of convex sets is to consider an initial set of points and draw segments, triangles, and any convex hull from it, then intersect them to obtain new points, and so forth. The result is an infinite…

Combinatorics · Mathematics 2024-07-25 Carles Cardó

An earlier paper describes a program to prove the Kepler conjecture on sphere packings. This paper carries out the second step of that program. A sphere packing leads to a decomposition of $R^3$ into polyhedra. The polyhedra are divided…

Metric Geometry · Mathematics 2007-05-23 Thomas C. Hales

Rationally convex topological embeddings of compact surfaces (closed or with boundary) into $\mathbb{C}^2$ are constructed.

Complex Variables · Mathematics 2018-11-08 Luke Broemeling , Rasul Shafikov

Any solid object can be decomposed into a collection of convex polytopes (in short, convexes). When a small number of convexes are used, such a decomposition can be thought of as a piece-wise approximation of the geometry. This…

Computer Vision and Pattern Recognition · Computer Science 2020-04-14 Boyang Deng , Kyle Genova , Soroosh Yazdani , Sofien Bouaziz , Geoffrey Hinton , Andrea Tagliasacchi

A new parametric surface representation is proposed that interpolates the vertices of a given closed mesh of arbitrary topology. Smoothly connecting quadrilateral patches are created by blending local, multi-sided quadratic interpolants. In…

Computational Geometry · Computer Science 2026-01-28 Péter Salvi

We prove two results about transforming any convex polyhedron, modeled as a linkage L of its edges. First, if we subdivide each edge of L in half, then L can be continuously flattened into a plane. Second, if L is equilateral and we again…

Computational Geometry · Computer Science 2024-12-20 Erik D. Demaine , Martin L. Demaine , Markus Hecher , Rebecca Lin , Victor H. Luo , Chie Nara

We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously…

Computational Geometry · Computer Science 2008-06-12 Timothy G. Abbott , Zachary Abel , David Charlton , Erik D. Demaine , Martin L. Demaine , Scott D. Kominers

This paper deals with the three types of regular polytopes which exist in all dimensions -- regular simplices, cubes and regular cross-polytopes -- and their outer and inner radii. While the inner radii of regular simplices are well…

General Mathematics · Mathematics 2007-05-23 Rene Brandenberg

In the paper we prove that the number of graphs inscribed into graph of a convex polyhedron and circumscribed around another graph does not exceed 4. For this we first studied Poncelet type problem about the number of convex $n$-gons…

General Mathematics · Mathematics 2025-09-22 Yagub N. Aliyev

Given a set of radii measured from a fixed point, the existence of a convex configuration with respect to the set of distinct radii in the two-dimensional case is proved when radii are distinct or repeated at most four points. However, we…

Computational Geometry · Computer Science 2025-08-22 Supanut Chaidee , Kokichi Sugihara

The regular polyhedra have the highest order of 3D symmetries and are exceptionally at- tractive templates for (self)-assembly using minimal types of building blocks, from nano-cages and virus capsids to large scale constructions like glass…

Computational Geometry · Computer Science 2015-07-31 Muhibur Rasheed , Chandrajit Bajaj

Every regular map on a closed surface gives rise to generally six regular maps, its "Petrie relatives", that are obtained through iteration of the duality and Petrie operations (taking duals and Petrie-duals). It is shown that the skeletal…

Combinatorics · Mathematics 2012-10-09 Anthony M. Cutler , Egon Schulte , Jorg M. Wills

We analyze the topology and geometry of a polyhedron of dimension 2 according to the minimum size of a cover by PL collapsible polyhedra. We provide partial characterizations of the polyhedra of dimension 2 that can be decomposed as the…

Geometric Topology · Mathematics 2018-02-06 Eugenio Borghini

We describe procedures for generating all 2-cell embedded simple graphs with up to a fixed number of vertices on a given surface. We also modify these procedures to generate closed 2-cell embeddings and polyhedral embeddings. We give…

Combinatorics · Mathematics 2015-09-23 Thom Sulanke

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

In this paper we present a necessary conditions, that simple close geodesics on regular tetrahedra in the 3-dimensional hyperbolic space must satisfy. Furthermore, we explicitly describe three classes of simple closed geodesics on regular…

Metric Geometry · Mathematics 2026-05-07 A. A. Borisenko , D. D. Sukhorebska

Denote by $S^2$ the two-dimensional sphere. A spherical convex body on $S^2$ which does not properly contain a spherical convex body of the same spherical thickness is called a reduced body. We give three characterizations of reducedness of…

Metric Geometry · Mathematics 2025-09-17 Marek Lassak

Polyhedral K\"ahler surfaces are a class of complex surfaces, which are flat everywhere except on a two-dimensional skeleton. They are defined as a generalisation of the "gluing a polygon side by side" construction of flat Riemann surfaces.…

Algebraic Geometry · Mathematics 2018-06-11 Cécile Gachet

Recent work of Ballas, Cooper, and Leitner identifies $(n+1)$ types of $n$-dimensional convex projective cusps, one of which is the standard hyperbolic cusp. Work of Ballas-Marquis, and Ballas-Danciger-Lee give examples of these exotic…

Geometric Topology · Mathematics 2019-02-06 Martin D. Bobb