English
Related papers

Related papers: Constructing flexible polyhedra by twinning

200 papers

A ball-polyhedron is the intersection with non-empty interior of finitely many (closed) unit balls in Euclidean 3-space. One can represent the boundary of a ball-polyhedron as the union of vertices, edges, and faces defined in a rather…

Metric Geometry · Mathematics 2013-02-13 Karoly Bezdek , Marton Naszodi

We build polyhedral complexes in Rn that coincide with dyadic grids with different orientations, while keeping uniform lower bounds (depending only on n) on the flatness of the added polyhedrons including their subfaces in all dimensions.…

Metric Geometry · Mathematics 2009-06-18 Vincent Feuvrier

We consider the problem of finding an inductive construction, based on vertex splitting, of triangulated spheres with a fixed number of additional edges (braces). We show that for any positive integer $b$ there is such an inductive…

Combinatorics · Mathematics 2021-07-09 James Cruickshank , Eleftherios Kastis , Derek Kitson , Bernd Schulze

It is shown that there are examples of distinct polyhedra, each with a Hamiltonian path of edges, which when cut, unfolds the surfaces to a common net. In particular, it is established for infinite classes of triples of tetrahedra.

Computational Geometry · Computer Science 2011-06-09 Joseph O'Rourke

Necessary and sufficient conditions are obtained for the infinitesimal rigidity of braced grids in the plane with respect to non-Euclidean norms. Component rectangles of the grid may carry 0, 1 or 2 diagonal braces, and the combinatorial…

Metric Geometry · Mathematics 2020-09-24 Stephen Power

Modeling folding surfaces with nonzero thickness is of practical interest for mechanical engineering. There are many existing approaches that account for material thickness in folding applications. We propose a new systematic and broadly…

Computational Geometry · Computer Science 2016-01-22 Jason S. Ku , Erik D. Demaine

In this paper, we show that deciding rigid foldability of a given crease pattern using all creases is weakly NP-hard by a reduction from Partition, and that deciding rigid foldability with optional creases is strongly NP-hard by a reduction…

Computational Geometry · Computer Science 2020-11-10 Hugo Akitaya , Erik D. Demaine , Takashi Horiyama , Thomas C. Hull , Jason S. Ku , Tomohiro Tachi

We present a novel method to perform numerical integration over curved polyhedra enclosed by high-order parametric surfaces. Such a polyhedron is first decomposed into a set of triangular and/or rectangular pyramids, whose certain faces…

Numerical Analysis · Mathematics 2022-05-11 Pablo Antolin , Xiaodong Wei , Annalisa Buffa

Mr. C. Stephanos posed the following question in the Interm\'ediaire des Math\'ematiciens: "Do there exist polyhedra with invariant facets that are susceptible to an infinite family of transformations that only alter solid angles and…

History and Overview · Mathematics 2012-03-07 Raoul Bricard

Uniform covers with a finite-dimensional nerve are rare (i.e., do not form a cofinal family) in many separable metric spaces of interest. To get hold on uniform homotopy properties of these spaces, a reasonably behaved notion of an…

Geometric Topology · Mathematics 2022-11-21 Sergey A. Melikhov

This paper gives new solutions to the problem: 'Can we construct monohedral tilings of the disk such that a neighbourhood of the origin has trivial intersection with at least one tile?'

Metric Geometry · Mathematics 2016-04-29 Joel Haddley , Stephen Worsley

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

It is well known that if there exists a finite set of convex bodies on the plane with non-overlapping interiors, then there is at least one "extremal" one among them, i.e., some one which can be continuously "taken away to the infinity"…

Metric Geometry · Mathematics 2022-01-03 Vassily O. Manturov , Alexei Kanel-Belov , Seongjeong Kim

Starting with an ideal triangulation of the interior of a compact 3-manifold M with boundary, no component of which is a 2-sphere, we provide a construction, called an inflation of the ideal triangulation, to obtain a strongly related…

Geometric Topology · Mathematics 2013-02-28 William H. Jaco , J. Hyam Rubinstein

We give inductive constructions of independent graphs that contain implied nonedges but do not contain any non-trivial rigid subgraphs, or \emph{nucleations}: some of the constructions and proofs apply to 3-dimensional abstract rigidity…

Combinatorics · Mathematics 2025-08-19 Jialong Cheng , Meera Sitharam , Ileana Streinu , William Sims

Slithering, crawling, slipping, gliding are various modes of limbless locomotion that have been mimicked for micro-manipulation of soft, slender and sessile objects. A lesser known mode is rolling which involves periodic, asymmetric and…

Soft Condensed Matter · Physics 2015-10-19 Dipabali Hore , Abhijit Majumder , Subrata Mondal , Abhijit Roy , Animangsu Ghatak

We construct knot invariants on the basis of ascribing Euclidean geometric values to a triangulation of sphere S^3 where the knot lies. The main new feature of this construction compared to the author's earlier papers on manifold invariants…

Geometric Topology · Mathematics 2007-05-23 I. G. Korepanov

It is shown that every orthogonal terrain, i.e., an orthogonal (right-angled) polyhedron based on a rectangle that meets every vertical line in a segment, has a grid unfolding: its surface may be unfolded to a single non-overlapping piece…

Computational Geometry · Computer Science 2007-07-12 Joseph O'Rourke

We introduce a new combinatorial abstraction for the graphs of polyhedra. The new abstraction is a flexible framework defined by combinatorial properties, with each collection of properties taken providing a variant for studying the…

Combinatorics · Mathematics 2012-11-02 Edward D. Kim

In combinatorial topology we aim to triangulate manifolds such that their topological properties are reflected in the combinatorial structure of their description. Here, we give a combinatorial criterion on when exactly triangulations of…

Geometric Topology · Mathematics 2018-10-24 Benjamin Burton , Jonathan Spreer