Related papers: Some New Insights from Highly Optimized Polyhedral…
There are three generalizations of the Platonic solids that exist in all dimensions, namely the hypertetrahedron, the hypercube, and the hyperoctahedron, with the latter two being dual. Conformal field theories with the associated symmetry…
Spectrahedra are linear sections of the cone of positive semidefinite matrices that, as convex bodies, generalize the class of polyhedra. In this paper we investigate the problem of recognizing when a spectrahedron is polyhedral. We reprove…
This paper presents a geometric approach to the classical isoperimetric problem by analysing the efficiency of regular polygons in enclosing maximum area for a fixed perimeter. Using efficiency metrics, it proves that regular polygons…
We isolate a geometric mechanism that complements the dynamical suppression of macroscopic interference: In a high-dimensional Hilbert space, almost all state vectors are nearly orthogonal, accommodating an exponentially large reservoir of…
Geometric embeddings have recently received attention for their natural ability to represent transitive asymmetric relations via containment. Box embeddings, where objects are represented by n-dimensional hyperrectangles, are a particularly…
Given a set of astrometric observations of the same object, the problem of orbit determination is to compute the orbit and to assess its uncertainty and reliability. For the next generation surveys, with much larger number density of…
Spanners for metric spaces have been extensively studied, both in general metrics and in restricted classes, perhaps most notably in low-dimensional Euclidean spaces -- due to their numerous applications. Euclidean spanners can be viewed as…
Variational analysis presents a unified theory encompassing in particular both smoothness and convexity. In a Euclidean space, convex sets and smooth manifolds both have straightforward local geometry. However, in the most basic hybrid case…
If the four triangular facets of a tetrahedron can be partitioned into pairs having the same area, then the triangles in each pair must be congruent to one another. A Heron-style formula is then derived for the volume of a tetrahedron…
This article deals with the existence of hypersurfaces minimizing general shape functionals under certain geometric constraints. We consider as admissible shapes orientable hypersurfaces satisfying a so-called reach condition, also known as…
We introduce the polytope of pointed pseudo-triangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on the increase of their distances. Its…
The study of comparison theorems in geometry has a rich history. In this paper, we establish a comparison theorem for polyhedra in 3-manifolds with nonnegative scalar curvature, answering affirmatively a dihedral rigidity conjecture by…
Partial cubes are graphs isometrically embeddable into hypercubes. In this paper it is proved that every cubic, vertex-transitive partial cube is isomorphic to one of the following graphs: $K_2 \, \square \, C_{2n}$, for some $n\geq 2$, the…
Cubature rules on the triangle have been extensively studied, as they are of great practical interest in numerical analysis. In most cases, the process by which new rules are obtained does not preclude the existence of similar rules with…
We prove that the combinatorial optimization problem of determining the hull number of a partial cube is NP-complete. This makes partial cubes the minimal graph class for which NP-completeness of this problem is known and improves some…
We propose a new method that takes advantage of structural reductions to accelerate the verification of reachability properties on Petri nets. Our approach relies on a state space abstraction, called polyhedral abstraction, which involves a…
Polycube segmentations for 3D models effectively support a wide variety of applications such as seamless texture mapping, spline fitting, structured multi-block grid generation, and hexahedral mesh construction. However, the automated…
For a planar point set $P$, its convex hull is the smallest convex polygon that encloses all points in $P$. The construction of the convex hull from an array $I_P$ containing $P$ is a fundamental problem in computational geometry. By…
In this paper, the Hermite problem has been approached finding a periodic representation (by means of periodic rational or integer sequences) for any cubic irrationality. In other words, the problem of writing cubic irrationals as a…
A perfect cuboid is a rectangular parallelepiped whose all linear extents are given by integer numbers, i. e. its edges, its face diagonals, and its space diagonal are of integer lengths. None of perfect cuboids is known thus far. Their…