English
Related papers

Related papers: Extending Bricard Octahedra

200 papers

We classify the convex polytopes whose symmetry groups have two orbits on the flags. These exist only in two or three dimensions, and the only ones whose combinatorial automorphism group is also two-orbit are the cuboctahedron, the…

Metric Geometry · Mathematics 2016-03-09 Nicholas Matteo

We survey literature on all known families and examples of Dehn invariant zero tetrahedra. We also contribute two previously unknown families of Dehn invariant zero tetrahedra. Following a suggestion of Dill and Habegger, we show that there…

Metric Geometry · Mathematics 2023-12-05 A. Anas Chentouf , Yihang Sun

A family of polytopes introduced by E.M. Feichtner, A. Postnikov and B. Sturmfels, which were named nestohedra, consists in each dimension of an interval of polytopes starting with a simplex and ending with a permutohedron. This paper…

Combinatorics · Mathematics 2017-08-08 Zoran Petric

In this paper we bring together tropical linear algebra and convex 3-dimensional bodies. We show how certain convex 3-dimensional bodies having 20 vertices and 12 facets can be encoded in a $4\times 4$ integer zero-diagonal matrix $A$. A…

Combinatorics · Mathematics 2012-11-01 A. Jiménez , M. J. de la Puente

This article defines a pair of combinatorial operations on the combinatorial structure of compact right-angled hyperbolic polyhedra in dimension three called decomposition and edge surgery. It is shown that these operations simplify the…

Geometric Topology · Mathematics 2014-10-01 Taiyo Inoue

The aim of this article is to show the existence, and also give an explicit construction, of infinite sets of orthogonal exponentials for certain families of convex polytopes which include simple-rational polytopes and also non simple…

Combinatorics · Mathematics 2019-09-19 Yehonatan Salman

We study biplane graphs drawn on a finite planar point set $S$ in general position. This is the family of geometric graphs whose vertex set is $S$ and can be decomposed into two plane graphs. We show that two maximal biplane graphs---in the…

Computational Geometry · Computer Science 2017-08-10 Alfredo García , Ferran Hurtado , Matias Korman , Inês Matos , Maria Saumell , Rodrigo I. Silveira , Javier Tejel , Csaba D. Tóth

We construct finite element Stokes complexes on tetrahedral meshes in three-dimensional space. In the lowest order case, the finite elements in the complex have 4, 18, 16, and 1 degrees of freedom, respectively. As a consequence, we obtain…

Numerical Analysis · Mathematics 2021-11-02 Kaibo Hu , Qian Zhang , Zhimin Zhang

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 start from any small strict monoidal braided Ab-category and extend it to a monoidal nonstrict braided Ab-category which contains braided bialgebras. The objects of the original category turn out to be modules for these bialgebras

Algebraic Topology · Mathematics 2010-07-02 Raul A. Perez , Carlos Prieto

Ghomi proved that every convex polyhedron could be stretched via an affine transformation so that it has an edge-unfolding to a net [Gho14]. A net is a simple planar polygon; in particular, it does not self-overlap. One can view his result…

Computational Geometry · Computer Science 2023-02-17 Joseph O'Rourke

Given a finite set $A\subset\mathbb{R}^d$, let Cov$_{r,k}$ denote the set of all points within distance $r$ to at least $k$ points of $A$. Allowing $r$ and $k$ to vary, we obtain a 2-parameter family of spaces that grow larger when $r$…

Computational Geometry · Computer Science 2022-04-15 René Corbet , Michael Kerber , Michael Lesnick , Georg Osang

A projective mirror polyhedron is a projective polyhedron endowed with reflections across its faces. We construct an explicit diffeomorphism between the moduli space of a mirror projective polyhedron with fixed dihedral angles in…

Geometric Topology · Mathematics 2012-04-26 Ludovic Marquis

In this article we consider an open conjecture about coherently labelling a polyhedron in three dimensions. We exhibit all the forty eight possible coherent labellings of a tetrahedron. We also exhibit that some simplicial polyhedra like…

Combinatorics · Mathematics 2022-11-28 C. P. Anil Kumar

We show how to edge-unfold a new class of convex polyhedra, specifically a new class of prismatoids (the convex hull of two parallel convex polygons, called the top and base), by constructing a nonoverlapping "petal unfolding" in two new…

Computational Geometry · Computer Science 2021-06-29 Vincent Bian , Erik Demaine , Rachana Madhukara

We show that for all $n \equiv 0 \pmod{6}$, $n \geq 18$, there is an orientable triangular embedding of the octahedral graph on $n$ vertices that can be augmented with handles to produce a genus embedding of the complete graph of the same…

Combinatorics · Mathematics 2024-12-24 Timothy Sun

A topological interlocking assembly consists of rigid blocks together with a fixed frame, such that any subset of blocks is kinematically constrained and therefore cannot be removed from the assembly. In this paper we pursue a modular…

Combinatorics · Mathematics 2024-05-06 Reymond Akpanya , Tom Goertzen , Alice C. Niemeyer

In the article, a series of neigbourly polyhedra is constructed. They have $N=2d+4$ vertices and are embedded in $\mathbb R^{2d}$. Their (affine) Gale diagrams in $\mathbb R^2$ have $d+3$ black points that form a convex polygon. These Gale…

Combinatorics · Mathematics 2015-10-12 Rostislav Devyatov

We study biplane graphs drawn on a finite point set $S$ in the plane in general position. This is the family of geometric graphs whose vertex set is $S$ and which can be decomposed into two plane graphs. We show that every sufficiently…

Computational Geometry · Computer Science 2017-08-10 Alfredo García , Ferran Hurtado , Matias Korman , Inês Matos , Maria Saumell , Rodrigo I. Silveira , Javier Tejel , Csaba D. Tóth

Icosahedral tilings, although non-periodic, are known to be characterized by their configurations of some finite size. This characterization has also been expressed in terms of a simple alternation condition. We provide an alternative proof…

Combinatorics · Mathematics 2016-08-16 Nicolas Bédaride , Thomas Fernique