Related papers: Experimental validation of volume-based comparison…
We prove a characterization of the dual mixed volume in terms of functional properties of the polynomial associated to it. To do this, we use tools from the theory of multilinear operators on spaces of continuos functions. Along the way we…
We introduce a definition of the volume for a general rectangular matrix, which for square matrices is equivalent to the absolute value of the determinant. We generalize results for square maximum-volume submatrices to the case of…
Let $B$ be a set of $n$ axis-parallel boxes in $\mathbb{R}^d$ such that each box has a corner at the origin and the other corner in the positive quadrant of $\mathbb{R}^d$, and let $k$ be a positive integer. We study the problem of…
We give a deterministic method of quasi-polynomial complexity to approximate the volume of the intersection of the unit hypercube with two specific sets. The method can actually be applied (without losing the quasi-polynomial complexity) to…
The univariate Ehrhart and $h^*$-polynomials of lattice polytopes have been widely studied. We describe methods from toric geometry for computing multivariate versions of volume, Ehrhart and $h^*$-polynomials of lattice polytropes, which…
Recent advances in the efficiency and robustness of algorithms solving convex quadratically constrained quadratic programming (QCQP) problems motivate developing techniques for creating convex quadratic relaxations that, although more…
Motivated by problems of uncertainty propagation and robust estimation we are interested in computing a polynomial sublevel set of fixed degree and minimum volume that contains a given semialgebraic set K. At this level of generality this…
In this work we study convex relaxations of quadratic optimisation problems over permutation matrices. While existing semidefinite programming approaches can achieve remarkably tight relaxations, they have the strong disadvantage that they…
Embedding geometries in structured grids allows a simple treatment of complex objects in fluid simulations. Various methods for embedding geometries are available. The commonly used Brinkman-volume-penalization models geometries as porous…
Given n convex bodies in the real space of dimension d, we consider the set of homogeneous polynomials of degree d in n variables that can be represented as their volume polynomial. This set is a subset of the set of Lorentzian polynomials.…
In this paper we give lower and upper bounds for the volume growth of a regular hyperbolic simplex, namely for the ratio of the $n$-dimensional volume of a regular simplex and the $(n-1)$-dimensional volume of its facets. In addition to the…
A face-centred finite volume (FCFV) method is proposed for the linear elasticity equation. The FCFV is a mixed hybrid formulation, featuring a system of first-order equations, that defines the unknowns on the faces (edges in two dimensions)…
The isothermal compressibility of an interacting or non interacting system may be extracted from the fluctuations of the number of particles in a well chosen control volume. Finite size effects are prevalent and should then be accounted for…
In the burgeoning field of medical imaging, precise computation of 3D volume holds a significant importance for subsequent qualitative analysis of 3D reconstructed objects. Combining multivariate calculus, marching cube algorithm, and…
Various results are proved giving lower bounds for the $m$th intrinsic volume $V_m(K)$, $m=1,\dots,n-1$, of a compact convex set $K$ in ${\mathbb{R}}^n$, in terms of the $m$th intrinsic volumes of its projections on the coordinate…
Volume approximation is an important problem found in many applications of computer graphics, vision, and image processing. The problem is about computing an accurate and compact approximate representation of 3D volumes using some simple…
The theory of intrinsic volumes of convex cones has recently found striking applications in areas such as convex optimization and compressive sensing. This article provides a self-contained account of the combinatorial theory of intrinsic…
Let $S\subset R^n$ be a compact basic semi-algebraic set defined as the real solution set of multivariate polynomial inequalities with rational coefficients. We design an algorithm which takes as input a polynomial system defining $S$ and…
The finite volume Laplacian can be defined in all dimensions and is a natural way to approximate the operator on a simplicial mesh. In the most general setting, its definition with orthogonal duals may require that not all volumes are…
Lattice polytope representation of natural numbers is introduced based on the fundamental theorem of arithmetic. The combinatorial and geometric properties of the polytopes are studied using Polymake and Qhull software. The volume of the…