English
Related papers

Related papers: On weakly convex star-shaped polyhedra

200 papers

The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex polyhedron, is infinitesimally rigid. We prove that it is indeed…

Differential Geometry · Mathematics 2007-05-23 Robert Connelly , Jean-Marc Schlenker

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…

Differential Geometry · Mathematics 2024-04-29 Jilly Kevo

Let $P \subset \R^3$ be a polyhedron. It was conjectured that if $P$ is weakly convex (i. e. its vertices lie on the boundary of a strictly convex domain) and decomposable (i. e. $P$ can be triangulated without adding new vertices), then it…

Differential Geometry · Mathematics 2010-10-19 Ivan Izmestiev , Jean-Marc Schlenker

We present a much simplified proof of Dehn's theorem on the infinitesimal rigidity of convex polytopes. Our approach is based on the ideas of Trushkina and Schramm.

Metric Geometry · Mathematics 2007-05-23 Igor Pak

Let $P$ be a (non necessarily convex) embedded polyhedron in $\R^3$, with its vertices on an ellipsoid. Suppose that the interior of $P$ can be decomposed into convex polytopes without adding any vertex. Then $P$ is infinitesimally rigid.…

Differential Geometry · Mathematics 2007-05-23 Jean-Marc Schlenker

We study convex polyhedra in $\mathbb{R}\mathbb{P}^3$ with all their vertices on a sphere. We do not require, in particular, that the polyhedra lie in the interior of the sphere, hence the term "weakly inscribed". Such polyhedra can be…

Metric Geometry · Mathematics 2020-02-05 Hao Chen , Jean-Marc Schlenker

We give a necessary and sufficient condition for gluings of hyperconvex metric spaces along weakly externally hyperconvex subsets in order that the resulting space be hyperconvex. This leads to a full characterization of gluings of two…

Metric Geometry · Mathematics 2015-07-29 Benjamin Miesch , Maël Pavón

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…

Geometric Topology · Mathematics 2023-07-28 Yunhi Cho , Seonhwa Kim

We consider 3-dimensional hyperbolic cone-manifolds, singular along infinite lines, which are ``convex co-compact'' in a natural sense. We prove an infinitesimal rigidity statement when the angle around the singular lines is less than…

Differential Geometry · Mathematics 2014-02-12 Sergiu Moroianu , Jean-Marc Schlenker

On R^n endowed with a riemannian metric of bounded nonpositive curvature, the weakly convex closed subsets are topologically trivial. The stability of such subsets under intersection characterizes the euclidean spaces.

Differential Geometry · Mathematics 2016-09-07 Stephane Grognet

A set is star-shaped if there is a point in the set that can see every other point in the set in the sense that the line-segment connecting the points lies within the set. We show that testing whether a non-empty compact smooth region is…

Computational Geometry · Computer Science 2025-11-20 Marcus Schaefer , Daniel Štefankovič

We state that any constant curvature Riemannian metric with conical singularities of constant sign curvature on a compact (orientable) surface $S$ can be realized as a convex polyhedron in a Riemannian or Lorentzian) space-form. Moreover…

Differential Geometry · Mathematics 2010-11-16 François Fillastre

A simple convex polytope $P$ is \emph{cohomologically rigid} if its combinatorial structure is determined by the cohomology ring of a quasitoric manifold over $P$. Not every $P$ has this property, but some important polytopes such as…

Algebraic Topology · Mathematics 2014-02-26 Suyoung Choi , Taras Panov , Dong Youp Suh

We verify the infinitesimal inversive rigidity of almost all triangulated circle polyhedra in the Euclidean plane $\mathbb{E}^{2}$, as well as the infinitesimal inversive rigidity of tangency circle packings on the $2$-sphere…

Metric Geometry · Mathematics 2018-07-26 John C. Bowers , Philip L. Bowers , Kevin Pratt

Using the orthogonal connectedness, we introduce the notion of orthogonal decomposability of convex polytopes and study it in the case of Platonic and Archimedean solids. While doing so, we also encounter polytopes which are not…

Combinatorics · Mathematics 2026-03-10 Julia Q. Du , Xuemei He , Xiaotian Song , Daniela Stiller , Liping Yuan , Tudor Zamfirescu

Recently Schrijver's open problem, whether the Chv\'atal--Gomory closure of an irrational polytope is polyhedral was answered independently in the affirmative by Dadush, Dey, and Vielma (even for arbitrarily compact convex set) as well as…

Combinatorics · Mathematics 2014-05-20 Gábor Braun , Sebastian Pokutta

We consider deformations of singular Lagrangian varieties in symplectic spaces. We show the coherence of the direct image sheaves of relative infinitesimal Lagrangian deformations. Using this result, we prove that, under some assumptions, a…

Algebraic Geometry · Mathematics 2007-05-23 Mauricio D. Garay

Provan and Billera introduced notions of (weak) decomposability of simplicial complexes as a means of attempting to prove polynomial upper bounds on the diameter of the facet-ridge graph of a simplicial polytope. Recently, De Loera and Klee…

Combinatorics · Mathematics 2023-11-14 Nicolai Hähnle , Steven Klee , Vincent Pilaud

Given a finite point set $P\subset\mathbb{R}^d$, we call a multiset $A$ a one-sided weak $\varepsilon$-approximant for $P$ (with respect to convex sets), if $|P\cap C|/|P|-|A\cap C|/|A|\leq\varepsilon$ for every convex set $C$. We show…

Combinatorics · Mathematics 2016-05-31 Boris Bukh , Gabriel Nivasch

A closed quasigeodesic on a convex polyhedron is a closed curve that is locally straight outside of the vertices, where it forms an angle at most $\pi$ on both sides. While the existence of a simple closed quasigeodesic on a convex…

Computational Geometry · Computer Science 2022-09-29 Jean Chartier , Arnaud de Mesmay
‹ Prev 1 2 3 10 Next ›