English
Related papers

Related papers: Weakly Inscribed Polyhedra

200 papers

We prove that finite area isolated singularities of surfaces with constant positive curvature in R^3 are removable singularities, branch points or immersed conical singularities. We describe the space of immersed conical singularities of…

Differential Geometry · Mathematics 2010-07-16 Jose A. Galvez , Laurent Hauswirth , Pablo Mira

A hyperbolic semi-ideal polyedron is a polyedron whose vertices lie inside the hyperbolic space $\mathbf{H}^{3}$ or at infinity. A hyperideal polyedron is, in the projective model, the intersection of $\mathbf{H}^{3}$ with a projective…

Geometric Topology · Mathematics 2007-05-23 Mathias Rousset

In this paper, we classify all of the five-sided three-dimensional hyperbolic polyhedra with one ideal vertex, which have the shape of a triangular prism. We show how to find each such polyhedron in the upper half-space model by considering…

Geometric Topology · Mathematics 2020-07-15 Grant S. Lakeland , Corinne G. Roth

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

In his paper "Shapes of Polyhedra and Triangulations of the Sphere", Thurston found that the set of shapes of convex polyhedra with prescribed cone-deficits has a complex hyperbolic structure. Inspired by his work, this paper studies the…

Geometric Topology · Mathematics 2018-11-19 Zili Wang

It is conjectured that every cusped hyperbolic 3-manifold has a decomposition into positive volume ideal hyperbolic tetrahedra (a "geometric" triangulation of the manifold). Under a mild homology assumption on the manifold we construct…

Geometric Topology · Mathematics 2014-02-26 Craig D. Hodgson , J. Hyam Rubinstein , Henry Segerman

We prove that, given a polyhedron $\mathcal P$ in $\mathbb{R}^3$, every point in $\mathbb R^3$ that does not see any vertex of $\mathcal P$ must see eight or more edges of $\mathcal P$, and this bound is tight. More generally, this remains…

Computational Geometry · Computer Science 2023-08-29 Csaba D. Tóth , Jorge Urrutia , Giovanni Viglietta

The classical Weyl problem (solved by Lewy, Alexandrov, Pogorelov, and others) asks whether any metric of curvature $K\geq 0$ on the sphere is induced on the boundary of a unique convex body in $\R^3$. The answer was extended to surfaces in…

Differential Geometry · Mathematics 2024-09-20 Jean-Marc Schlenker

We consider the convex quadratic optimization problem with indicator variables and arbitrary constraints on the indicators. We show that a convex hull description of the associated mixed-integer set in an extended space with a quadratic…

Optimization and Control · Mathematics 2022-11-29 Linchuan Wei , Alper Atamtürk , Andrés Gómez , Simge Küçükyavuz

We establish a connection between two previously unrelated topics: a particular discrete version of conformal geometry for triangulated surfaces, and the geometry of ideal polyhedra in hyperbolic three-space. Two triangulated surfaces are…

Geometric Topology · Mathematics 2015-09-02 Alexander Bobenko , Ulrich Pinkall , Boris Springborn

A Fuchsian polyhedron in hyperbolic space is a polyhedral surface invariant under the action of a Fuchsian group of isometries (i.e. a group of isometries leaving globally invariant a totally geodesic surface, on which it acts cocompactly).…

Differential Geometry · Mathematics 2007-05-23 François Fillastre

A spherical polyhedron surface is a triangulated surface obtained by isometric gluing of spherical triangles. For instance, the boundary of a generic convex polytope in the 3-sphere is a spherical polyhedron surface. This paper investigates…

Geometric Topology · Mathematics 2016-09-07 Feng Luo

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

An n-simplex is said to be n-well-centered if its circumcenter lies in its interior. We introduce several other geometric conditions and an algebraic condition that can be used to determine whether a simplex is n-well-centered. These…

Computational Geometry · Computer Science 2009-12-17 Evan VanderZee , Anil N. Hirani , Damrong Guoy , Vadim Zharnitsky , Edgar Ramos

A convex polygon $Q$ is inscribed in a convex polygon $P$ if every side of $P$ contains at least one vertex of $Q$. We present algorithms for finding a minimum area and a minimum perimeter convex polygon inscribed in any given convex…

Metric Geometry · Mathematics 2021-09-24 Csenge Lili Ködmön , Zsolt Lángi

We study two notions. One is that of spindle convexity. A set of circumradius not greater than one is spindle convex if, for any pair of its points, it contains every short circular arc of radius at least one, connecting them. The other…

Metric Geometry · Mathematics 2011-10-20 Karoly Bezdek , Zsolt Langi , Marton Naszodi , Peter Papez

For $3$-dimensional convex polytopes, inscribability is a classical property that is relatively well-understood due to its relation with Delaunay subdivisions of the plane and hyperbolic geometry. In particular, inscribability can be tested…

Let X be a space of constant curvature and P be a convex polyhedron in X. A Coxeter decomposition of the polyhedron P is a decomposition of P into finitely many Coxeter polyhedra, such that any two polyhedra having a common facet are…

Metric Geometry · Mathematics 2007-05-23 A. Felikson

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

We analyze polyhedra composed of hexagons and triangles with three faces around each vertex, and their 3-regular planar graphs of edges and vertices, which we call "trihexes". Trihexes are analogous to fullerenes, which are 3-regular planar…

Combinatorics · Mathematics 2025-07-01 Linda Green , Stellen Li