Related papers: 3D Volume Calculation For the Marching Cubes Algor…
The very recent volume-enclosing surface extraction algorithm, VESTA, is revisited. VESTA is used to determine implicit surfaces that are potentially contained in 3D data sets, such as 3D image data and/or 3D simulation data. VESTA surfaces…
In this paper we describe a numerical method designed for modelling different kinds of astrophysical flows in three dimensions. Our method is a standard explicit finite difference method employing the local shearing-box technique. To model…
Fluorescence microscopy is an essential tool for the analysis of 3D subcellular structures in tissue. An important step in the characterization of tissue involves nuclei segmentation. In this paper, a two-stage method for segmentation of…
Several methods of triclustering of three dimensional data require the specification of the cluster size in each dimension. This introduces a certain degree of arbitrariness. To address this issue, we propose a new method, namely the…
A self-consistent procedure for the ion-induced soft error rate calculation in space environment taking into account Error Correcting Codes is proposed. The method is based on the partitioning of the multiple cell events into groups with…
This paper presents an alternate choice of computing the convex hulls (CHs) for planar point sets. We firstly discard the interior points and then sort the remaining vertices by x- / y- coordinates separately, and later create a group…
In areas as diverse as contemporary art, play structures, climbing equipment, and modular construction toys, we see the presence of building block-like polyhedral complexes, which are generalizations of the pieces in the game Tetris. We…
Finite volume methods for problems involving second order operators with full diffusion matrix can be used thanks to the definition of a discrete gradient for piecewise constant functions on unstructured meshes satisfying an orthogonality…
We investigate the possibilities to calculate vector partition functions by means of iterated partial fraction decomposition, as suggested by Beck (2004). Particularly, for an important type of families of rational functions, we describe an…
We construct high order symmetric volume-preserving methods for the relativistic dynamics of a charged particle by the splitting technique with processing. Via expanding the phase space to include time $t$, we give a more general…
We describe an efficient algorithm to compute a pseudotriangulation of a finite planar family of pairwise disjoint convex bodies presented by its chirotope. The design of the algorithm relies on a deepening of the theory of visibility…
We compute the volumes of convex bodies that are given by inequalities of concave polynomials. These volumes are found to arbitrary precision thanks to the representation of periods by linear differential equations. Our approach rests on…
We describe an algorithm that takes as input an open book decomposition of a closed oriented 4-manifold and outputs an explicit trisection diagram of that 4-manifold. Moreover, a slight variation of this algorithm also works for open books…
To definite and compute differential invariants, like curvatures, for triangular meshes (or polyhedral surfaces) is a key problem in CAGD and the computer vision. The Gaussian curvature and the mean curvature are determined by the…
We present a method for fabricating general models with multi-directional 3D printing systems by printing different model regions along with different directions. The core of our method is a support-effective volume decomposition algorithm…
Subdivision surfaces are proven to be a powerful tool in geometric modeling and computer graphics, due to the great flexibility they offer in capturing irregular topologies. This paper discusses the robust and efficient implementation of an…
This paper shows how partial differential problems can be solved thanks to cellular computing and an adaptation of the Least Squares Finite Elements Method. As cellular computing can be implemented on distributed parallel architectures,…
We present a deterministic polynomial-time algorithm for estimating the volume of a hypercube intersected by a fixed number of constraints of the type $f(x) \leq b$, where $f$ is the sum of univariate functions that are each nonnegative,…
Owing to their favorable scaling with dimensionality, Monte Carlo (MC) methods have become the tool of choice for numerical integration across the quantitative sciences. Almost invariably, efficient MC integration schemes are strictly…
Identification of local structure in intensive data -- such as time series, images, and higher dimensional processes -- is an important problem in astronomy. Since the data are typically generated by an inhomogeneous Poisson process, an…