English
Related papers

Related papers: Sufficiently Fat Polyhedra are not 2-castable

200 papers

We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have…

Computational Geometry · Computer Science 2010-01-21 Erik D. Demaine , David Eppstein , Jeff Erickson , George W. Hart , Joseph O'Rourke

In view of solving problems of geometric realizability of polyhedra with given geometric constraints, we describe the space of geometric realizations of a simply-connected triangulated euclidean polyhedron in $\mathbb{R}^3$ up to similarity…

Metric Geometry · Mathematics 2017-03-10 Maria Hempel

In this paper, we discuss f- and flag-vectors of 4-dimensional convex polytopes and cellular 3-spheres. We put forward two crucial parameters of fatness and complexity: Fatness F(P) := (f_1+f_2-20)/(f_0+f_3-10) is large if there are many…

Metric Geometry · Mathematics 2007-05-23 Günter M. Ziegler

On a flat plane, convexity of a set is preserved by both radial expansion and contraction of the set about any point inside it. Using the Poincar\'e disk model of hyperbolic geometry, we prove that radial expansion of a hyperbolic convex…

Differential Geometry · Mathematics 2020-02-13 Dhruv Kohli , Jeffrey M. Rabin

In this article we pose the problem of existence and uniqueness of convex body for which the projection curvature radius function coincides with given function. We find a necessary and sufficient condition that ensures a positive answer to…

Differential Geometry · Mathematics 2016-09-07 Aramyan Rafik

A polyiamond is a polygon composed of unit equilateral triangles, and a generalized deltahedron is a convex polyhedron whose every face is a convex polyiamond. We study a variant where one face may be an exception. For a convex polygon P,…

We study the problem of whether rectangular polyominoes with holes are cube-foldable, that is, whether they can be folded into a cube, if creases are only allowed along grid lines. It is known that holes of sufficient size guarantee that…

Computational Geometry · Computer Science 2025-10-23 Florian Lehner , Benjamin Shirley

The notion of a spiral unfolding of a convex polyhedron, resulting by flattening a special type of Hamiltonian cut-path, is explored. The Platonic and Archimedian solids all have nonoverlapping spiral unfoldings, although among generic…

Computational Geometry · Computer Science 2015-10-20 Joseph O'Rourke

We construct a family of manifolds, one for each $n\geq 2$, having a nontrivial Massey $n$-product in their cohomology. These manifolds turn out to be smooth closed 2-connected manifolds with a compact torus action called moment-angle…

Algebraic Topology · Mathematics 2017-11-15 Ivan Limonchenko

For a positive integer $n$, an $n$-sided polygon lying on a circular arc or, shortly, an $n$-fan is a sequence of $n+1$ points on a circle going counterclockwise such that the "total rotation" $\delta$ from the first point to the last one…

Algebraic Geometry · Mathematics 2017-10-25 Delbrin Ahmed , Gábor Czédli , Eszter K. Horváth

We prove that a closed convex subset $C$ of a complete linear metric space $X$ is polyhedral in its closed linear hull if and only if no infinite subset $A\subset X\backslash C$ can be hidden behind $C$ in the sense $[x,y]\cap C\not =…

Functional Analysis · Mathematics 2011-11-22 Taras Banakh , Ivan Hetman

This paper gives a partial confirmation of a conjecture of P. Agarwal, S. Har-Peled, M. Sharir, and K. Varadarajan that the total curvature of a shortest path on the boundary of a convex polyhedron in the 3-dimensional Euclidean space…

Metric Geometry · Mathematics 2007-05-23 Imre Barany , Krystyna Kuperberg , Tudor Zamfirescu

While faces of a polytope form a well structured lattice, in which faces of each possible dimension are present, this is not true for general compact convex sets. We address the question of what dimensional patterns are possible for the…

Metric Geometry · Mathematics 2017-03-23 Vera Roshchina , Tian Sang , David Yost

Cannon, Swenson, and others have proved numerous theorems about subdivision rules associated to hyperbolic groups with a 2-sphere at infinity. However, few explicit examples are known. We construct an explicit subdivision rule for many…

Geometric Topology · Mathematics 2014-10-01 Brian Rushton

We present fast simulation methods for the self-assembly of complex shapes in two dimensions. The shapes are modeled via a general boundary curve and interact via a standard volume term promoting overlap and an interpenetration penalty. To…

Computational Physics · Physics 2023-12-11 Lukas Mayrhofer , Myfanwy E. Evans , Gero Friesecke

In this work, we reconsider the study of 2D materials involving double lattice structures associated with periodic polygons. In tessellated periodic representation, it appears two periodic polygons of $k$ sides of unequal side lengths at…

Materials Science · Physics 2019-05-30 Adil Belhaj , Salah Eddine Ennadifi

Bounding hull, such as convex hull, concave hull, alpha shapes etc. has vast applications in different areas especially in computational geometry. Alpha shape and concave hull are generalizations of convex hull. Unlike the convex hull, they…

Computational Geometry · Computer Science 2014-12-11 Saeed Asaeedi , Farzad Didehvar , Ali Mohades

Let $C\subset {\mathbb R}^n$ be a convex body. We introduce two notions of convexity associated to C. A set $K$ is $C$-ball convex if it is the intersection of translates of $C$, or it is either $\emptyset$, or ${\mathbb R}^n$. The $C$-ball…

Metric Geometry · Mathematics 2012-09-06 Zsolt Lángi , Márton Naszódi , István Talata

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 consider the problem of packing congruent circles with the maximum radius in a unit square as a mathematical optimization problem. Due to the presence of non-overlapping constraints, this problem is a notoriously difficult nonconvex…

Optimization and Control · Mathematics 2024-04-05 Aida Khajavirad