中文
相关论文

相关论文: A Classification of Flexible Kokotsakis Polyhedra …

200 篇论文

Across various scientific and engineering domains, a growing interest in flexible and deployable structures is becoming evident. These structures facilitate seamless transitions between distinct states of shape and find broad applicability…

环与代数 · 数学 2024-01-26 Yang Liu , Yi Ouyang , Dominik L. Michels

A Kokotsakis polyhedron with quadrangular base is a neighborhood of a quadrilateral in a quad surface. Generically, a Kokotsakis polyhedron is rigid. Up to now, several flexible classes were known, but a complete classification was missing.…

度量几何 · 数学 2014-11-04 Ivan Izmestiev

In this paper, we introduce and study a remarkable class of mechanisms formed by a $3 \times 3$ arrangement of rigid quadrilateral faces with revolute joints at the common edges. In contrast to the well-studied Kokotsakis meshes with a…

In this paper we study geometric, algebraic, and computational aspects of flexibility and infinitesimal flexibility of Kokotsakis meshes. A Kokotsakis mesh is a mesh that consists of a face in the middle and a certain band of faces attached…

微分几何 · 数学 2008-12-17 Oleg Karpenkov

Kokotsakis studied the following problem in 1932: Given is a rigid closed polygonal line (planar or non-planar), which is surrounded by a polyhedral strip, where at each polygon vertex three faces meet. Determine the geometries of these…

计算几何 · 计算机科学 2022-02-17 Georg Nawratil

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…

度量几何 · 数学 2019-05-07 Ivan Erofeev , Grigory Ivanov

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…

组合数学 · 数学 2026-03-11 Matthias Himmelmann , Bernd Schulze , Martin Winter

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…

度量几何 · 数学 2020-06-08 Victor Alexandrov

Given a polyhedral surface, assume that it is prohibited to change the shape and size of any face but it is permissible to change the dihedral angles between the faces. A polyhedral surface is said to be flexible if it is possible to change…

度量几何 · 数学 2007-05-23 Victor Alexandrov

We demonstrate the existence of four types of flexible prismatic polyhedra that can be derived or inferred from a consideration of Bricard octahedra and generalizations of Bricard octahedra. These flexible polyhedra are of genus 0 and 1,…

度量几何 · 数学 2014-07-09 Gerald D. Nelson

This work investigates flexible Kokotsakis polyhedra with a quadrangular base of equimodular elliptic type, filling a significant gap in the literature by providing the first explicit constructions of this type together with an explicit…

度量几何 · 数学 2025-11-25 A. Nurmatov , M. Skopenkov , F. Rist , J. Klein , D. L. Michels

In view of solving problems of geometric realizability of polyhedra with given geometric constraints, we describe the space of geometric realizations of a simply-connected triangulated euclidean polyhedron in $\mathbb{R}^3$ up to similarity…

度量几何 · 数学 2017-03-10 Maria Hempel

We classify here combinatorially rigid simple polytopes with three facets more than their dimension.

组合数学 · 数学 2015-12-01 Frédéric Bosio

When the number of non-triangular faces adjacent to a vertex $v$ is less than or equal to three, the vertex $v$ will be called (\emph{combinatorially}) \emph{rigid}. We study the number of rigid vertices and suggest a conjecture on a…

度量几何 · 数学 2017-03-16 Seonhwa Kim , Yunhi Cho

It is conjectured that all decomposable (i.e. interior can be triangulated without adding new vertices) polyhedra with vertices in convex position are infinitesimally rigid and only recently has it been shown that this is indeed true under…

微分几何 · 数学 2024-04-29 Jilly Kevo

We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of Minkowski decomposability. Various properties of skeletons of polytopes are exhibited, each sufficient to guarantee indecomposability of a…

组合数学 · 数学 2016-07-05 Krzysztof Przesławski , David Yost

Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the same combinatorial structure as convex polyhedra. In…

计算几何 · 计算机科学 2007-05-23 Marshall Bern , Erik D. Demaine , David Eppstein , Eric Kuo , Andrea Mantler , Jack Snoeyink

We prove that every three-dimensional polyhedron is uniquely determined by its dihedral angles and edge lengths, even if nonconvex or self-intersecting, under two plausible sufficient conditions: (i) the polyhedron has only convex faces and…

几何拓扑 · 数学 2023-07-28 Yunhi Cho , Seonhwa Kim

A surface is considered flexible if it allows a continuous deformation that preserves both metric and smoothness. We introduce a novel construction method, called 'base + crinkle,' for generating a broad class of non-self-intersecting…

度量几何 · 数学 2025-11-11 Zeyuan He , Simon D. Guest

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…

原子与分子团簇 · 物理学 2022-09-20 KLaus E. Hermann
‹ 上一页 1 2 3 10 下一页 ›