中文
相关论文

相关论文: A characterization of convex hyperbolic polyhedra …

200 篇论文

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…

几何拓扑 · 数学 2016-09-07 Feng Luo

W. M. Hirsch formulated a beautiful conjecture on diameters of convex polyhedra.I suggest a new viewpoint with the deformation and moduli of polytopes.

组合数学 · 数学 2008-04-25 Yuji Odaka

We generalize Cauchy's celebrated theorem on the global rigidity of convex polyhedra in Euclidean $3$-space $\mathbb{E}^{3}$ to the context of circle polyhedra in the $2$-sphere $\mathbb{S}^{2}$. We prove that any two convex and proper…

度量几何 · 数学 2017-06-05 John C. Bowers , Philip L. Bowers , Kevin Pratt

Classical H.Minkowski theorems on existence and uniqueness of convex polyhedra with prescribed directions and areas of faces as well as the well-known generalization of H.Minkowski uniqueness theorem due to A.D.Alexandrov are extended to a…

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

We survey the Hilbert geometry of convex polytopes. In particular we present two important characterisations of these geometries, the first one in terms of the volume growth of their metric balls, the second one as a bi-lipschitz class of…

度量几何 · 数学 2014-12-02 Constantin Vernicos

A very fundamental geometric problem on finite systems of spheres was independently phrased by Kneser (1955) and Poulsen (1954). According to their well-known conjecture if a finite set of balls in Euclidean space is repositioned so that…

度量几何 · 数学 2011-09-29 Karoly Bezdek

The theory of intrinsic volumes of convex cones has recently found striking applications in areas such as convex optimization and compressive sensing. This article provides a self-contained account of the combinatorial theory of intrinsic…

组合数学 · 数学 2017-08-23 Dennis Amelunxen , Martin Lotz

We introduce an axiomatic theory of spherical diagrams as a tool to study certain combinatorial properties of polyhedra in $\mathbb R^3$, which are of central interest in the context of Art Gallery problems for polyhedra and other…

组合数学 · 数学 2023-05-31 Giovanni Viglietta

In 1972, E. P. Senkin generalized the celebrated theorem of A. V. Pogorelov on unique determination of compact convex surfaces by their intrinsic metrics in the Euclidean 3-space $E^3$ to higher dimensional Euclidean spaces $E^{n+1}$ under…

微分几何 · 数学 2024-06-25 Alexander A. Borisenko

A locally finite face-to-face tiling of euclidean d-space by convex polytopes is called combinatorially multihedral if its combinatorial automorphism group has only finitely many orbits on the tiles. The paper describes a local…

度量几何 · 数学 2008-09-16 Nikolai Dolbilin , Egon Schulte

By Andreev theorem acute-angled polyhedra of finite volume in a hyperbolic space $\mathbb H^{3}$ are uniquely determined by combinatorics of their 1-skeletons and dihedral angles. For a class of compact right-angled polyhedra and a class of…

几何拓扑 · 数学 2020-10-22 A. Egorov , A. Vesnin

We prove that, among all convex hyperbolic polygons with given angles, the perimeter is minimized by the unique polygon with an inscribed circle. The proof relies on work of J.-M.\ Schlenker.

几何拓扑 · 数学 2010-10-08 Joan Porti

The deformation theory of hyperbolic and Euclidean cone-manifolds with all cone angles less then 2{\pi} plays an important role in many problems in low dimensional topology and in the geometrization of 3-manifolds. Furthermore, various old…

微分几何 · 数学 2015-03-13 Rafe Mazzeo , Gregoire Montcouquiol

We describe the first-order variations of the angles of Euclidean, spherical or hyperbolic polygons under infinitesimal deformations such that the lengths of the edges do not change. Using this description, we introduce a vector-valued…

微分几何 · 数学 2007-06-24 Jean-Marc Schlenker

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…

度量几何 · 数学 2011-10-20 Karoly Bezdek , Zsolt Langi , Marton Naszodi , Peter Papez

We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of…

计算几何 · 计算机科学 2016-08-12 David Eppstein , Elena Mumford

We introduce the set of framed convex polyhedra with N faces as the symplectic quotient C^2N//SU(2). A framed polyhedron is then parametrized by N spinors living in C^2 satisfying suitable closure constraints and defines a usual convex…

数学物理 · 物理学 2015-06-16 Etera R. Livine

A convex polyhedron $P$ is $k$-equiprojective if all of its orthogonal projections, i.e., shadows, except those parallel to the faces of $P$ are $k$-gon for some fixed value of $k$. Since 1968, it is an open problem to construct all…

A "spectral convex set" is a collection of symmetric matrices whose range of eigenvalues form a symmetric convex set. Spectral convex sets generalize the Schur-Horn orbitopes studied by Sanyal-Sottile-Sturmfels (2011). We study this class…

度量几何 · 数学 2025-02-12 Raman Sanyal , James Saunderson

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