English
Related papers

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

200 papers

We show that there is an almost complex structure on a differential calculus on finite points coming from a bidirected finite graph without multiple edges or loops. We concentrate on a polygon as a concrete case. In particular, a…

Quantum Algebra · Mathematics 2024-06-07 Soumalya Joardar , Atibur Rahaman

We extend the notion of a star unfolding to be based on a simple quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron P to a simple, planar polygon: shortest paths from…

Computational Geometry · Computer Science 2008-12-15 Jin-ichi Itoh , Joseph O'Rourke , Costin Vîlcu

A tetrahedron is called a path tetrahedron, if it has three mutually orthogonal edges that do not intersect at a single point. A tetrahedron is called a 4-ball tetrahedron, if there exists a sphere tangent to all its edges. We derive…

Metric Geometry · Mathematics 2026-01-14 Sergey Korotov , Michal Krizek

We give a new characterization of spaces with nonnegative curvature in the sense of Alexandrov.

Metric Geometry · Mathematics 2018-07-09 Nina Lebedeva , Anton Petrunin

We develop a quite elementary graph theoretic system for designing small-size augmented origami polyhedra out of Sonob\'e modules beginning with a (convex or not) deltahedron.

General Mathematics · Mathematics 2007-08-25 Adrian Riskin

In this paper we deal with edge-to-edge, irreducible decompositions of a centrally symmetric convex $(2k)$-gon into centrally symmetric convex pieces. We prove an upper bound on the number of these decompositions for any value of $k$, and…

Metric Geometry · Mathematics 2016-02-09 Júlia Frittmann , Zsolt Lángi

In this paper, we give a comparison version of Pythagorean Theorem to judge the lower or upper bound of the curvature of Alexandrov spaces (including Riemannian manifolds).

Metric Geometry · Mathematics 2019-11-05 Xiaole Su , Hongwei Sun , Yusheng Wang

We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…

Combinatorics · Mathematics 2013-11-27 Pavel Kozhevnikov

Cyclohedra are a well-known infinite familiy of finite-dimensional polytopes that can be constructed from centrally symmetric triangulations of even-sided polygons. In this article we introduce an infinite-dimensional analogue and prove…

Group Theory · Mathematics 2014-11-14 Ariadna Fossas Tenas , Jon McCammond

A mostly expository account of old questions about the relationship between polyhedra and topological manifolds. Topics are old topological results, new gauge theory results (with speculations about next directions), and history of the…

Geometric Topology · Mathematics 2013-11-13 Frank Quinn

The aim of this paper is to study alcoved polytopes, which are polytopes arising from affine Coxeter arrangements. This class of convex polytopes includes many classical polytopes, for example, the hypersimplices. We compare two…

Combinatorics · Mathematics 2007-05-23 Thomas Lam , Alexander Postnikov

A systematic study of the contributions at infinity for the cohomology of variations of polarized Hodge structures over quasicompact K\"ahler manifolds. Several isomorphisms between different cohomologies given.

Algebraic Geometry · Mathematics 2007-05-23 Juergen Jost , Yihu Yang , Kang Zuo

We describe a characterization of convex polyhedra in $\h^3$ in terms of their dihedral angles, developed by Rivin. We also describe some geometric and combinatorial consequences of that theory. One of these consequences is a combinatorial…

Metric Geometry · Mathematics 2016-09-06 Craig D. Hodgson , Igor Rivin , Warren D. Smith

We consider the problem of $L^1$ (un)boundedness for a wide class of orthogonal projections, including Bergman projections on domains in complex manifolds and Szeg\"o projections on abstract CR manifolds.

Complex Variables · Mathematics 2021-04-12 Gian Maria Dall'Ara

Given an iterated function system of affine dilations with fixed points the vertices of a regular polygon, we characterize which points in the limit set lie on the boundary of its convex hull.

Dynamical Systems · Mathematics 2018-11-20 Danny Calegari , Alden Walker

The aim of this article is to show the existence, and also give an explicit construction, of infinite sets of orthogonal exponentials for certain families of convex polytopes which include simple-rational polytopes and also non simple…

Combinatorics · Mathematics 2019-09-19 Yehonatan Salman

An edge-unfolding of a polyhedron is produced by cutting along edges and flattening the faces to a *net*, a connected planar piece with no overlaps. A *grid unfolding* allows additional cuts along grid edges induced by coordinate planes…

Computational Geometry · Computer Science 2007-05-23 Mirela Damian , Robin Flatland , Joseph O'Rourke

We prove that Alexandrov's conjecture relating the area and diameter of a convex surface holds for the surface of a general ellipsoid. This is a direct consequence of a more general result which estimates the deviation from the optimal…

Differential Geometry · Mathematics 2015-12-04 Pedro Freitas , David Krejcirik

This paper aims to develop the mathematical representation of a surface generated by elliptical arcs joining the sides of a regular polygon to a point lying vertically upward on the central axis of the polygon. The volume of the…

History and Overview · Mathematics 2020-09-02 Shahid Saeed Siddiqi , Abdul Rauf Nizami

A quasigeodesic is a curve on the surface of a convex polyhedron that has $\le \pi$ surface to each side at every point. In contrast, a geodesic has exactly $\pi$ to each side and so can never pass through a vertex, whereas quasigeodesics…