Related papers: Solid angle measure of polyhedral cones

We develop techniques to construct a series of sparse polyhedral approximations of the semidefinite cone. Motivated by the semidefinite (SD) bases proposed by Tanaka and Yoshise (2018), we propose a simple expansion of SD bases so as to…

Collision detection is a critical functionality for robotics. The degree to which objects collide cannot be represented as a continuously differentiable function for any shapes other than spheres. This paper proposes a framework for…

The moment-SOS (sum of squares) hierarchy is a powerful approach for solving globally non-convex polynomial optimization problems (POPs) at the price of solving a family of convex semidefinite optimization problems (called moment-SOS…

The aim of this paper is to study finite orthogonal polynomials on a cone of revolution and its surface. We define two classes of finite orthogonal polynomials on the solid cone and derive their corresponding differential equations and…

We present a regularization of the recently proposed fundamental-measure functional for a mixture of parallel hard cubes. The regularized functional is shown to have right dimensional crossovers to any smaller dimension, thus allowing to…

In this article, we present a unified algebraic-combinatorial framework for computing explicit, piecewise rational, and combinatorially indexed parametric formulas for volumes and higher moments of slices and slabs of polyhedral norm balls.…

We solve some computational problems for triangulated closed three-dimensional manifolds using groups of simplicial homology and cohomology modulo 2. Two efficient algorithms for computing the intersection numbers of 1- and 2-dimensional…

A signed polygonal measure is the sum of finitely many real constant density measures supported on polygons. Given a finite set S in the plane, we study the existence of signed polygonal measures spanned by polygons with vertices in S,…

The deformation theory of hyperbolic and Euclidean cone-manifolds with all cone angles less then 2{\pi} plays an important role in many problems in low dimensional topology and in the geometrization of 3-manifolds. Furthermore, various old…

Statistical problems often involve linear equality and inequality constraints on model parameters. Direct estimation of parameters restricted to general polyhedral cones, particularly when one is interested in estimating low dimensional…

Let X be a space of constant curvature and P be a convex polyhedron in X. A Coxeter decomposition of the polyhedron P is a decomposition of P into finitely many Coxeter polyhedra, such that any two polyhedra having a common facet are…

This article is concerned with the problem of approximating a not necessarily bounded spectrahedral shadow, a certain convex set, by polyhedra. By identifying the set with its homogenization the problem is reduced to the approximation of a…

In this article, we found all simple closed geodesics on regular spherical octahedra and spherical cubes. In addition, we estimate the number of simple closed geodesics on regular spherical tetrahedra.

Compact polyhedra of cubic point symmetry Oh, exhibit surfaces of planar sections (facets) characterized by normal vector families {abc} with up to 48 members each, compatible with Oh symmetry. We focus first on polyhedra confined by facets…

The study of the combinatorial diameter of a polyhedron is a classical topic in linear-programming theory due to its close connection with the possibility of a polynomial simplex-method pivot rule. The 2-sum operation is a classical…

We investigate the semigroup of integer points inside a convex cone. We extend classical results in integer linear programming to integer conic programming. We show that the semigroup associated with nonpolyhedral cones can sometimes have a…

The specialised uses of solid angles mean that they are quite unfamiliar quantities. This article, apart from making solid angles a little more familiar, brings out several topics of general interest, such as how units are interrelated and…

Efficient representations of convex sets are of crucial importance for many algorithms that work with them. It is well-known that sometimes, a complicated convex set can be expressed as the projection of a much simpler set in higher…

We introduce a natural notion of depth that applies to individual cutting planes as well as entire families. This depth has nice properties that make it easy to work with theoretically, and we argue that it is a good proxy for the practical…

In this paper we generalize previous work on decomposition in three-dimensional orbifolds by 2-groups realized as analogues of central extensions, to orbifolds by more general 2-groups. We describe the computation of such orbifolds in…