English
Related papers

Related papers: On Flexible Prismatic Polyhedra

200 papers

Finding necessary conditions for the geometry of flexible polyhedra is a classical problem that has received attention also in recent times. For flexible polyhedra with triangular faces, we showed in a previous work the existence of cycles…

Metric Geometry · Mathematics 2022-05-24 Matteo Gallet , Georg Grasegger , Jan Legerský , Josef Schicho

A framework, which is a (possibly infinite) graph with a realization of its vertices in the plane, is called flexible if it can be continuously deformed while preserving the edge lengths. We focus on flexibility of frameworks in which…

Combinatorics · Mathematics 2024-04-26 Georg Grasegger , Jan Legerský

We study structural and enumerative aspects of pure simplicial complexes and clique complexes. We prove a necessary and sufficient condition for any simplicial complex to be a clique complex that depends only on the list of facets. We also…

Combinatorics · Mathematics 2024-11-21 Kassahun H Betre , Yan X Zhang , Carter Edmond

We consider right prisms with horizontal quadrilateral bases and tops, and vertical rectangular sides. We look for examples where all the edges, face diagonals and space diagonals are integers. We find examples when the base is an isosceles…

Number Theory · Mathematics 2010-06-17 Allan J. MacLeod

Let X be a flexible variety of F be an isomorphism of closed one-dimensional subschemes of $X$. We develop criteria which guarantee that F extends to au automorphism of X.

Algebraic Geometry · Mathematics 2021-04-05 Shulim Kaliman , David Udumyan

We consider facet-Hamiltonian cycles of polytopes, defined as cycles in their skeleton such that every facet is visited exactly once. These cycles can be understood as optimal watchman routes that guard the facets of a polytope. We consider…

Combinatorics · Mathematics 2024-11-05 Hugo Akitaya , Jean Cardinal , Stefan Felsner , Linda Kleist , Robert Lauff

Skeletal polyhedra are discrete connected structures consisting of finite (planar or skew) or infinite (linear, planar, or spatial) polygons as faces, with two faces on each edge and a circular vertex figure at each vertex. The present…

Combinatorics · Mathematics 2026-02-24 Egon Schulte , Tomas Skacel

We study the Art Gallery Problem for face guards in polyhedral environments. The problem can be informally stated as: how many (not necessarily convex) windows should we place on the external walls of a dark building, in order to completely…

Computational Geometry · Computer Science 2014-04-22 Giovanni Viglietta

Compact polyhedra of cubic point symmetry Oh, exhibit surfaces of planar sections (facets) characterized by normal vector families {abc} with up to 48 members each, compatible with Oh symmetry. We focus first on polyhedra confined by facets…

Atomic and Molecular Clusters · Physics 2022-09-20 KLaus E. Hermann

We prove that Dirichlet stereohedra for non-cubic crystallographic groups in dimension 3 cannot have more than 80 facets. The bound depends on the particular crystallographic group considered and is above 50 only on 9 of the 97 affine…

Combinatorics · Mathematics 2007-05-23 Daciana Bochis , Francisco Santos

We prove that the Dehn invariants of any Bricard octahedron remain constant during the flex and that the Strong Bellows Conjecture holds true for the Steffen flexible polyhedron.

Metric Geometry · Mathematics 2011-08-01 Victor Alexandrov

It is well known that there exist twenty two symmetry type graphs associated to 4-orbit maps. For this ones we give the feasible values taken by the degree of the vertices and the number appropriate of edges in the boundary of each face of…

Combinatorics · Mathematics 2021-01-26 John A. Arredondo , Camilo Ramírez Maluendas , Luz Edith Santos Guerrero

We show that every orthogonal polyhedron of genus at most 2 can be unfolded without overlap while using only a linear number of orthogonal cuts (parallel to the polyhedron edges). This is the first result on unfolding general orthogonal…

Computational Geometry · Computer Science 2016-11-02 Mirela Damian , Erik Demaine , Robin Flatland , Joseph O'Rourke

We investigate a novel setting for polytope rigidity, where a flex must preserve edge lengths and the planarity of faces, but is allowed to change the shapes of faces. For instance, the regular cube is flexible in this notion. We present…

Combinatorics · Mathematics 2026-03-11 Matthias Himmelmann , Bernd Schulze , Martin Winter

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 explore some generalizations of fullerenes F_v (simple polyhedra with v vertices and only 5- and 6-gonal faces) seen as (d-1)-dimensional simple manifolds (preferably, spherical or polytopal) with only 5- and 6-gonal 2-faces. First,…

Combinatorics · Mathematics 2007-05-23 M. Deza , M. I. Shtogrin

We study the properties of Kokotsakis polyhedra of orthodiagonal anti-involutive type. Stachel conjectured that a certain resultant connected to a polynomial system describing flexion of a Kokotsakis polyhedron must be reducible. Izmestiev…

Metric Geometry · Mathematics 2019-05-07 Ivan Erofeev , Grigory Ivanov

An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). It is a long unsolved problem to determine whether every polyhedron…

Computational Geometry · Computer Science 2007-05-23 Mirela Damian , Robin Flatland , Joseph O'Rourke

We define a notion for unfolding smooth, ruled surfaces, and prove that every smooth prismatoid (the convex hull of two smooth curves lying in parallel planes), has a nonoverlapping "volcano unfolding." These unfoldings keep the base…

Computational Geometry · Computer Science 2015-03-12 Nadia Benbernou , Patricia Cahn , Joseph O'Rourke

The problem of constructing a limit series of Penrose type partitions of a two-dimensional sphere is solved, which makes it possible to model quasicrystals possessing a point icosahedral group symmetry Ih. Images of polyhedron models are…

Materials Science · Physics 2018-04-24 Alexander S. Prokhoda