Related papers: Different Volume Computation Methods of Graph Poly…
We provide two algorithms for computing the volume of a convex polytope with half-space representation {x>=0; Ax <=b} for some (m,n) matrix A and some m-vector b. Both algorithms have a O(n^m) computational complexity which makes them…
In this paper, we consider the volume of a special kind of flow polytope. We show that its volume satisfies a certain system of differential equations, and conversely, the solution of the system of differential equations is unique up to a…
We construct a quasi-polynomial time deterministic approximation algorithm for computing the volume of an independent set polytope with restrictions. Randomized polynomial time approximation algorithms for computing the volume of a convex…
Computing mixed volume of convex polytopes is an important problem in computational algebraic geometry. This paper establishes sufficient conditions under which the mixed volume of several convex polytopes exactly equals the normalized…
Speakman and Lee (2017) gave a formula for the volume of the convex hull of the graph of a trilinear monomial, $y=x_1x_2x_3$, over a box in the nonnegative orthant, in terms of the upper and lower bounds on the variables. This was done in…
The type-PQ adjacency polytope associated to a simple graph is a $0/1$-polytope containing valuable information about an underlying power network. Chen and the first author have recently demonstrated that, when the underlying graph $G$ is…
Motivated by understanding the quality of tractable convex relaxations of intractable polytopes, Ko et al. gave a closed-form expression for the volume of a standard relaxation $\mathscr{Q}(G)$ of the boolean quadric polytope (also known as…
This note wants to explain how to obtain meaningful pictures of (possibly high-dimensional) convex polytopes, triangulated manifolds, and other objects from the realm of geometric combinatorics such as tight spans of finite metric spaces…
In this article we prove a formula for the volume of 4-dimensional polytopes, in terms of their face bivectors, and the crossings within their boundary graph. This proves that the volume is an invariant of bivector-coloured graphs in $S^3$.
Volume computation for $d$-polytopes $\mathcal{P}$ is fundamental in mathematics. There are known volume computation algorithms, mostly based on triangulation or signed-decomposition of $\mathcal{P}$. We consider $…
In this paper, four distinct approaches to Volume of Fluid (VOF) computational method are compared. Two of the methods are the 'simplified' VOF formulations, in that they do not require geometrical interface reconstruction. The assessment…
This note provides a simple proof for the equality between the normalized volume of a convex polytope with $m$ vertices and the mixed volume of $m$ simplices and thus shows the seemingly restrictive problem of computing mixed volume of…
We experimentally study the fundamental problem of computing the volume of a convex polytope given as an intersection of linear inequalities. We implement and evaluate practical randomized algorithms for accurately approximating the…
For any closed orientable 3-manifold, there is a volume function defined on the space of all Seifert representations of the fundamental group. The maximum absolute value of this function agrees with the Seifert volume of the manifold due to…
In this note we give asymptotic estimates for the volume growth associated to suitable infinite graphs. Our main application is to give an asymptotic estimate for volume growth associated to translation surfaces.
We describe the computation of polytope volumes by descent in the face lattice, its implementation in Normaliz, and the connection to reverse-lexicographic triangulations. The efficiency of the algorithm is demonstrated by several high…
This paper presents a general formulation of the CIP/multi-moment finite volume method (CIP/MM FVM) for arbitrary order of accuracy. Reconstruction up to arbitrary order can be built on single cell by adding extra derivative moments at the…
We apply an algorithm for measuring the volume of polytopes described by Jim Lawrence to polytropes. By using a tropical form of Cramer's rule, we found an efficient way to find all pseudovertices which are necessary for computing the…
To adopt a practical method to calculate the action of geometrical operators on quantum states is a crucial task in loop quantum gravity. In the series of papers, we will introduce a graphical method, developed by Yutsis and Brink, to loop…
This paper presents an algorithm to compute the value of the inverse Laplace transforms of rational functions with poles on arrangements of hyperplanes. As an application, we present an efficient computation of the partition function for…