Related papers: An Upper Bound on the Average Size of Silhouettes
A convex polygon is defined as a sequence (V_0,...,V_{n-1}) of points on a plane such that the union of the edges [V_0,V_1],..., [V_{n-2},V_{n-1}], [V_{n-1},V_0] coincides with the boundary of the convex hull of the set of vertices…
We show that every orthogonal polyhedron of genus at most 2 can be unfolded without overlap while using only a linear number of orthogonal cuts (parallel to the polyhedron edges). This is the first result on unfolding general orthogonal…
This work introduces a complexity measure which addresses some conflicting issues between existing ones by using a new principle - measuring the average amount of symmetry broken by an object. It attributes low (although different)…
The symmetry dimension of a geometric structure is the dimension of its symmetry algebra. We investigate symmetries of almost quaternionic structures of quaternionic dimension $n$. The maximal possible symmetry is realized by the…
The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a key issue to compute it for massive graphs in the context of complex network analysis. However, known algorithms, including the ones…
Polygonalization of any smooth billiard boundary can be carried out in several ways. We show here that the semiclassical description depends on the polygonalization process and the results can be inequivalent. We also establish that…
The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppstein [Separating thickness from geometric thickness. In: Towards a…
It is verified that the number of vertices in a $d$-dimensional cubical pseudomanifold is at least $2^{d+1}$. Using Adin's cubical $h$-vector, the generalized lower bound conjecture is established for all cubical 4-spheres, as well as for…
Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…
We derive upper and lower bounds on the sum of distances of a spherical code of size $N$ in $n$ dimensions when $N\sim n^\alpha, 0<\alpha\le 2.$ The bounds are derived by specializing recent general, universal bounds on energy of spherical…
It is shown that if $C$ is an $n$-dimensional convex body then there is an affine image $\widetilde C$ of $C$ for which $${|\partial \widetilde C|\over |\widetilde C|^{n-1\over n}}$$ is no larger than the corresponding expression for a…
We present a survey article about the geometry of convex bodies on the $d$-dimensional sphere $S^d$. We concentrate on the results based on the notion of the width of a convex body $C \subset S^d$ determined by a supporting hemisphere of…
The Gauss-Bonnet theorem for a polyhedron (a union of finitely many compact convex polytopes) in $n$-dimensional Euclidean space expresses the Euler characteristic of the polyhedron as a sum of certain curvatures, which are different from…
Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the same combinatorial structure as convex polyhedra. In…
The deviation of a general convex body with twice differentiable boundary and an arbitrarily positioned polytope with a given number of vertices is studied. The paper considers the case where the deviation is measured in terms of the…
A weighted game or a threshold function in general admits different weighted representations even if the sum of non-negative weights is fixed to one. Here we study bounds for the diameter of the corresponding weight polytope. It turns out…
Surveillance and surveying are two important applications of empirical research. A major part of terrain modelling is supported by photographic surveys which are used for capturing expansive natural surfaces using a wide range of sensors --…
We prove upper bounds on the face numbers of simplicial complexes in terms on their girths, in analogy with the Moore bound from graph theory. Our definition of girth generalizes the usual definition for graphs.
We provide a sharp lower bound for the perimeter of the inner parallel sets of a convex body $\Omega$. The bound depends only on the perimeter and inradius $r$ of the original body and states that \[|\partial\Omega_t| \geq…
Consider random shadows of a cube and of a regular tetrahedron. Area and perimeter of the former are positively dependent (with correlation 0.915...), whereas area and perimeter of the latter appear to be negatively dependent. This is only…