English
Related papers

Related papers: Old and new geometric polyhedra with few vertices

200 papers

We introduce a notion of $k$-convexity and explore polygons in the plane that have this property. Polygons which are \mbox{$k$-convex} can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard…

Computational Geometry · Computer Science 2010-07-22 Oswin Aichholzer , Franz Aurenhammer , Erik D. Demaine , Ferran Hurtado , Pedro Ramos , Jorge Urrutia

A completely well-centered tetrahedral mesh is a triangulation of a three dimensional domain in which every tetrahedron and every triangle contains its circumcenter in its interior. Such meshes have applications in scientific computing and…

Computational Geometry · Computer Science 2008-08-06 Evan VanderZee , Anil N. Hirani , Damrong Guoy

We study the problem of acute triangulations of convex polyhedra and the space R^n. Here an acute triangulation is a triangulation into simplices whose dihedral angles are acute. We prove that acute triangulations of the n-cube do not exist…

Metric Geometry · Mathematics 2009-11-20 Eryk Kopczyński , Igor Pak , Piotr Przytycki

Retaining the combinatorial Euclidean structure of a regular icosahedron, namely the 20 equiangular (planar) triangles, the 30 edges of length 1, and the 12 different vertices together with the incidence structure, we investigate variations…

There is no 5,7-triangulation of the torus, that is, no triangulation with exactly two exceptional vertices, of degree 5 and 7. Similarly, there is no 3,5-quadrangulation. The vertices of a 2,4-hexangulation of the torus cannot be…

Combinatorics · Mathematics 2013-09-17 Ivan Izmestiev , Robert B. Kusner , Günter Rote , Boris Springborn , John M. Sullivan

New heterotic torsional geometries are constructed as orbifolds of T^2 bundles over K3. The discrete symmetries considered can be freely-acting or have fixed points and/or fixed curves. We give explicit constructions when the base K3 is…

High Energy Physics - Theory · Physics 2014-02-10 Melanie Becker , Li-Sheng Tseng , Shing-Tung Yau

This thesis explores two specific topics of discrete geometry, the multitriangulations and the polytopal realizations of products, whose connection is the problem of finding polytopal realizations of a given combinatorial structure. A…

Combinatorics · Mathematics 2010-09-09 Vincent Pilaud

We study nearly parallel $\mathrm{G}_{2}$-structures with a three-torus symmetry via multi-moment map techniques. An effective three-torus action on a nearly parallel $\mathrm{G}_{2}$-manifold yields a multi-moment map. The torus acts…

Differential Geometry · Mathematics 2026-05-18 Giovanni Russo , Andrew Swann

We describe a 3-parametric family $\mathcal{K}$ of properly embedded minimal tori with four parallel ends in quotients of $\mathbb{R}^3$ by two independent translations, which we will call the \textit{Standard Examples.} These surfaces…

Differential Geometry · Mathematics 2007-05-23 M. Magdalena Rodriguez

In this paper our main result states that there exist exactly three combinatorially distinct centrally-symmetric 12-vertex-triangulations of the product of two 2-spheres with a cyclic symmetry. We also compute the automorphism groups of the…

Combinatorics · Mathematics 2007-05-23 G. Lassmann , E. Sparla

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

We show that the maximum number of convex polygons in a triangulation of $n$ points in the plane is $O(1.5029^n)$. This improves an earlier bound of $O(1.6181^n)$ established by van Kreveld, L\"offler, and Pach (2012) and almost matches the…

Metric Geometry · Mathematics 2017-08-10 Adrian Dumitrescu , Csaba D. Tóth

We classify trivalent graphs with 16 vertices and 16 edges that arise from intersecting two quadratic surfaces in tropical 3-space. There are 4,009 such graphs, representing maximally degenerate stable models of elliptic curves realized as…

Combinatorics · Mathematics 2025-07-30 Laura Casabella , Lars Kastner , Raluca Vlad

We consider tilings of the plane with 12-fold symmetry obtained by the cut and projection method. We compute their cohomology groups using the techniques introduced by the second author, Hunton and Kellendonk. To do this we completely…

K-Theory and Homology · Mathematics 2021-04-15 Nicolas Bedaride , Franz Gahler , Ana G. Lecuona

Using elementary graded automorphisms of polytopal algebras (essentially the coordinate rings of projective toric varieties) polyhedral versions of the group of elementary matrices and the Steinberg and Milnor groups are defined. They…

K-Theory and Homology · Mathematics 2007-05-23 Winfried Bruns , Joseph Gubeladze

We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of…

Computational Geometry · Computer Science 2015-09-03 Jonathan Klawitter , Martin Nöllenburg , Torsten Ueckerdt

It is conjectured that every cusped hyperbolic 3-manifold has a decomposition into positive volume ideal hyperbolic tetrahedra (a "geometric" triangulation of the manifold). Under a mild homology assumption on the manifold we construct…

Geometric Topology · Mathematics 2014-02-26 Craig D. Hodgson , J. Hyam Rubinstein , Henry Segerman

This research provides algorithms and numerical methods to geometrically control the magnitude of the internal and external forces in the reciprocal diagrams of 3D/Polyhedral Graphic statics (3DGS). In 3DGS, the form of the structure and…

Computational Geometry · Computer Science 2020-07-31 Masoud Akbarzadeh , Marton Hablicsek

Consider an orthogonal polyhedron, i.e., a polyhedron where (at least after a suitable rotation) all faces are perpendicular to a coordinate axis, and hence all edges are parallel to a coordinate axis. Clearly, any facial angle and any…

Computational Geometry · Computer Science 2013-12-25 Therese Biedl , Martin Derka , Stephen Kiazyk , Anna Lubiw , Hamide Vosoughpour

We show that in any triangulation of a solid torus, there is a pre-core curve that lies in the 2-skeleton and that intersects the interior of each face in at most 10 straight arcs. By definition, a pre-core curve is a simple closed curve…

Geometric Topology · Mathematics 2011-06-16 Marc Lackenby