Related papers: A Pseudopolynomial Algorithm for Alexandrov's Theo…
A polyhedron $\textbf{P} \subset \mathbb{R}^3$ has Rupert's property if a hole can be cut into it, such that a copy of $\textbf{P}$ can pass through this hole. There are several works investigating this property for some specific polyhedra:…
We consider the problem of finding the shortest possible period for an exactly periodic solution to some given autonomous ordinary differential equation. We show that, given a pair of Lyapunov-like observable functions defined over the…
A well-known result in the study of convex polyhedra, due to Minkowski, is that a convex polyhedron is uniquely determined (up to translation) by the directions and areas of its faces. The theorem guarantees existence of the polyhedron…
It is commonly known that in Riemannian and sub-Riemannian Geometry, the metric tensor on a manifold defines a distance function. In Lorentzian Geometry, instead of a distance function it provides causal relations and the Lorentzian…
Given an input matrix polynomial whose coefficients are floating point numbers, we consider the problem of finding the nearest matrix polynomial which has rank at most a specified value. This generalizes the problem of finding a nearest…
A new decomposition optimization algorithm, called \textit{path-following gradient-based decomposition}, is proposed to solve separable convex optimization problems. Unlike path-following Newton methods considered in the literature, this…
A numerical method is proposed to compute a low-rank Galerkin approximation to the solution of a parametric or stochastic equation in a non-intrusive fashion. The considered nonlinear problems are associated with the minimization of a…
We describe an algorithm to construct an intrinsic Delaunay triangulation of a smooth closed submanifold of Euclidean space. Using results established in a companion paper on the stability of Delaunay triangulations on $\delta$-generic…
Distance functions of metric spaces with lower curvature bound, by definition, enjoy various metric inequalities; triangle comparison, quadruple comparison and the inequality of Lang-Schroeder-Sturm. The purpose of this paper is to study…
We consider consecutive random subdivision of polygons described as follows. Given an initial convex polygon with $d\ge 3$ edges, we choose a point at random on each edge, such that the proportions in which these points divide edges are…
A high-level description of an algorithm which computes the minimum perimeter triangle enclosing a convex polygon in linear time exists in the literature. Besides that an implementation of the algorithm is given in the subsequent work.…
We devise an algorithm that approximately computes the number of paths of length $k$ in a given directed graph with $n$ vertices up to a multiplicative error of $1 \pm \varepsilon$. Our algorithm runs in time $\varepsilon^{-2} 4^k(n+m)…
An algorithm for the computation of global discrete conformal parametrizations with prescribed global holonomy signatures for triangle meshes was recently described in [Campen and Zorin 2017]. In this paper we provide a detailed analysis of…
We study the problem of synthesizing polyhedral Lyapunov functions for hybrid linear systems. Such functions are defined as convex piecewise linear functions, with a finite number of pieces. We first prove that deciding whether there exists…
The Voronoi diagram is a certain geometric data structure which has numerous applications in various scientific and technological fields. The theory of algorithms for computing 2D Euclidean Voronoi diagrams of point sites is rich and…
The problem to compute the vertices of a polytope given by affine inequalities is called vertex enumeration. The inverse problem, which is equivalent by polarity, is called the convex hull problem. We introduce `approximate vertex…
We develop a collection of numerical algorithms which connect ideas from polyhedral geometry and algebraic geometry. The first algorithm we develop functions as a numerical oracle for the Newton polytope of a hypersurface and is based on…
In multi-objective optimization, computing the entire non-dominated set (also known as the Pareto front or the Pareto frontier) is often intractable. However, for any multiplicative factor greater than one, an approximation set can be…
We introduce a notion of probabilistic convexity and generalize some classical globalization theorems in Alexandrov geometry. A weighted Alexandrov's lemma is developed as a basic tool.
We study all the ways that a given convex body in $d$ dimensions can break into countably many pieces that move away from each other rigidly at constant velocity, with no rotation or shearing. The initial velocity field is locally constant,…