English
Related papers

Related papers: A Note on Unbounded Polyhedra Derived from Convex …

200 papers

This note establishes that every polyhedron that has a Hamiltonian quasigeodesic can be edge-unfolded to a net, and shows that the class of such polyhedra is infinite.

Computational Geometry · Computer Science 2025-06-24 Joseph O'Rourke

The convex hull peeling of a point set consists in taking the convex hull, then removing the extreme points and iterating that procedure until no point remains. The boundary of each hull is called a layer. Following on from [15], we study…

Probability · Mathematics 2024-10-10 Pierre Calka , Gauthier Quilan

This paper describes a way to subdivide a 3-manifold into angled blocks, namely polyhedral pieces that need not be simply connected. When the individual blocks carry dihedral angles that fit together in a consistent fashion, we prove that a…

Geometric Topology · Mathematics 2009-03-06 David Futer , François Guéritaud

The convex hull generated by the restriction to the unit ball of a stationary Poisson point process in the $d$-dimensional Euclidean space is considered. By establishing sharp bounds on cumulants, exponential estimates for large deviation…

Probability · Mathematics 2015-12-15 Julian Grote , Christoph Thaele

A well-known result in the study of convex polyhedra, due to Minkowski, is that a convex polyhedron is uniquely determined (up to translation) by the directions and areas of its faces. The theorem guarantees existence of the polyhedron…

Computational Geometry · Computer Science 2017-12-06 Giuseppe Sellaroli

Counting Euclidean triangulations with vertices in a finite set $\C$ of the convex hull $\conv(\C)$ of $\C$ is difficult in general, both algorithmically and theoretically. The aim of this paper is to describe nearly convex polygons, a…

Combinatorics · Mathematics 2010-12-13 Roland Bacher , Frédéric Mouton

This paper is an introduction to Coxeter polyhedra in spherical, Euclidean, and hyperbolic geometries. It consists of essentially two parts that could be read independently. In the first we introduce non-obtuse polyhedra in the spherical,…

Geometric Topology · Mathematics 2026-05-04 Bruno Martelli

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

In this note, we reformulate Donaldson's construction as a compactness result. Approximately holomorphic sections accumulate to "limit holomorphic sections" and uniform transversality properties of the approximately holomorphic sections…

Symplectic Geometry · Mathematics 2021-06-08 Jean-Paul Mohsen

We prove that for any non-symmetric irreducible divisible convex set, the proximal limit set is the full projective boundary.

Metric Geometry · Mathematics 2021-06-15 Pierre-Louis Blayac

Let $\mathcal{W}^{n}$ be the class of $C^{\infty }$ complete simply connected $n-$dimensional manifolds without conjugate points. The hyperbolic space as well as Euclidean space are good examples of such manifolds. Let $% W\in…

Differential Geometry · Mathematics 2019-12-05 Sameh Shenawy

We prove that if the associated fourth order tensor of a quadratic form has a linear elastic cubic symmetry then it is quasiconvex if and only if it is polyconvex, i.e. a sum of convex and null-Lagrangian quadratic forms. We prove that…

Analysis of PDEs · Mathematics 2016-11-26 Davit Harutyunyan , Graeme Walter Milton

We prove that for every metric on the torus with curvature bounded from below by -1 in the sense of Alexandrov there exists a hyperbolic cusp with convex boundary such that the induced metric on the boundary is the given metric. The proof…

Metric Geometry · Mathematics 2015-12-15 François Fillastre , Ivan Izmestiev , Giona Veronelli

We construct a class of bounded domains, on which the squeezing function is not uniformly bounded from below near a smooth and pseudoconvex boundary point.

Complex Variables · Mathematics 2017-04-11 John Erik Fornaess , Feng Rong

An example is given of a UFD which has infinitely generated Derksen invariant. The ring is \textquotedblleft almost rigid\textquotedblright\ meaning that the Derksen invariant is equal to the Makar-Limanov invariant. Techniques to show that…

Algebraic Geometry · Mathematics 2007-06-29 David Finston , Stefan Maubach

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…

Computational Geometry · Computer Science 2010-09-14 Masud Hasan , Mohammad Monoar Hossain , Alejandro López-Ortiz , Sabrina Nusrat , Saad Altaful Quader , Nabila Rahman

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

Metric Geometry · Mathematics 2026-03-10 Steven Hoehner

The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…

Probability · Mathematics 2022-01-11 M. Reitzner , C. Schuett , E. M. Werner

In this study, the properties of convex hexagons that can form rotationally symmetric edge-to-edge tilings are discussed. Because the convex hexagons are equilateral convex parallelohexagons, convex pentagons generated by bisecting the…

Metric Geometry · Mathematics 2022-05-05 Teruhisa Sugimoto

We consider triangle faced convex polyhedra inscribed in the unit sphere $S^2$ in ${\Bbb{R}}^3$. One way of measuring their deviation from regular polyhedra with triangular faces is to consider the quotient of the lengths of the longest and…

Metric Geometry · Mathematics 2019-09-09 E. Makai,