Related papers: 3D Volume Calculation For the Marching Cubes Algor…
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…
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…
The novel "Volume-Enclosing Surface exTraction Algorithm" (VESTA) generates triangular isosurfaces from computed tomography volumetric images and/or three-dimensional (3D) simulation data. Here, we present various benchmarks for GPU-based…
In this paper, a second-order accurate method was developed for calculating fluid flows in complex geometries. This method uses cut-Cartesian cell mesh in finite volume framework. Calculus is employed to relate fluxes and gradients along…
The volume of a Meissner polyhedron is computed in terms of the lengths of its dual edges. This allows to reformulate the Meissner conjecture regarding constant width bodies with minimal volume as a series of explicit finite dimensional…
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 $…
We present a novel method to perform numerical integration over curved polyhedra enclosed by high-order parametric surfaces. Such a polyhedron is first decomposed into a set of triangular and/or rectangular pyramids, whose certain faces…
The mixed volume counts the roots of generic sparse polynomial systems. Mixed cells are used to provide starting systems for homotopy algorithms that can find all those roots, and track no unnecessary path. Up to now, algorithms for that…
This paper introduces a novel method for the efficient and accurate computation of the volume of a domain whose boundary is given by an orientable hypersurface which is implicitly given as the iso-contour of a sufficiently smooth level-set…
A random recursive cell splitting scheme of the $2$-dimensional unit sphere is considered, which is the spherical analogue of the STIT tessellation process from Euclidean stochastic geometry. First-order moments are computed for a large…
A calculation formula of volume of revolution with integration by parts of definite integral is derived based on monotone function, and extended to a general case that curved trapezoids is determined by continuous, piecewise strictly…
Given five points in a three-dimensional euclidean space, one can consider five tetrahedra, using those points as vertices. We present a pentagon-like formula containing the product of three volumes of those tetrahedra in its l.h.s. and the…
Calculations of the Fourier transform of a constant quantity over an area or volume defined by polygons (connected vertices) are often useful in modeling wave scattering, or in fourier-space filtering of real-space vector-based volumes and…
The computational cost in evaluation of the volume of a body using numerical integration grows exponentially with dimension of the space $n$. The most generally applicable algorithms for estimating $n$-volumes and integrals are based on…
Tracking of plant cells in images obtained by microscope is a challenging problem due to biological phenomena such as large number of cells, non-uniform growth of different layers of the tightly packed plant cells and cell division.…
The handling of topology changes in two-phase flows, such as breakup or coalescence of interfaces, with front tracking is a well-known problem that requires an additional effort to perform explicit manipulations of the Lagrangian front. In…
A method is proposed for the characterisation of the entropy of cellular structures, based on the compactivity concept for granular packings. Hamiltonian-like volume functions are constructed both in two and in three dimensions, enabling…
Marching surfaces is a method for isosurface extraction and approximation based on a $G^1$ multi-sided patch interpolation scheme. Given a 3D grid of scalar values, an underlying curve network is formed using second order information and…
In previous works [physics/0204035, physics/0404052, physics/0509126] a procedure was described for dividing the $3 \times N$-dimensional conformational space of a molecular system into a number of discrete cells, this partition allowed 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…