Related papers: A Comparison of Fundamental Methods for Iso-surfac…
Different methods for simulating the effects of spatial resolution on magnetic field maps are compared, including those commonly used for inter-instrument comparisons. The investigation first uses synthetic data, and the results are…
In this paper, we present a surface remeshing method with high approximation quality based on Principal Component Analysis. Given a triangular mesh and a user assigned polygon/vertex budget, traditional methods usually require the extra…
Isosurface visualization is fundamental for exploring and analyzing 3D volumetric data. Marching cubes (MC) algorithms with linear interpolation are commonly used for isosurface extraction and visualization. Although linear interpolation is…
We fully generalize a previously-developed computational geometry tool [1] to perform large-scale simulations of arbitrary two-dimensional faceted surfaces $z = h(x,y)$. Our method uses a three-component facet/edge/junction storage model,…
The decomposition method which makes the parallel solution of the block-tridiagonal matrix systems possible is presented. The performance of the method is analytically estimated based on the number of elementary multiplicative operations…
In recent years more and more long-term broadband data sets are collected in geosciences. Therefore there is an urgent need of algorithms which semi-automatically analyse and decompose these data into separate periods which are associated…
Investigation of cell structure is hardly imaginable without bright-field microscopy. Numerous modifications such as depth-wise scanning or videoenhancement make this method being state-of-the-art. This raises a question what maximal…
We present a new efficient way to perform hybrid density functional theory (DFT) based electronic structure calculation. The new method uses an interpolative separable density fitting (ISDF) procedure to construct a set of numerical…
Finding the symmetric and orthogonal decomposition (SOD) of a tensor is a recurring problem in signal processing, machine learning and statistics. In this paper, we review, establish and compare the perturbation bounds for two natural types…
Most linear dimension reduction methods proposed in the literature can be formulated using an appropriate pair of scatter matrices, see e.g. Ye and Weiss (2003), Tyler et al. (2009), Bura and Yang (2011), Liski et al. (2014) and Luo and Li…
We consider the decoupling theory of a broad class of $C^5$ surfaces $\mathbb{M} \subset \mathbb{R}^3$ lacking planar points. In particular, our approach also applies to surfaces which are not graphed by mixed homogeneous polynomials. The…
New methods for $D$-decomposition analysis are presented. They are based on topology of real algebraic varieties and computational real algebraic geometry. The estimate of number of root invariant regions for polynomial parametric families…
This paper explores a comparative study of both the linear and kernel implementations of three of the most popular Appearance-based Face Recognition projection classes, these being the methodologies of Principal Component Analysis, Linear…
3D local feature extraction and matching is the basis for solving many tasks in the area of computer vision, such as 3D registration, modeling, recognition and retrieval. However, this process commonly draws into false correspondences, due…
Compared with full volume rendering, isosurface rendering has several well recognized advantages in efficiency and accuracy. However, standard isosurface rendering has some limitations in effectiveness. First, it uses a monotone colored…
Isogeometric Analysis (IGA) is a computational technique for the numerical approximation of partial differential equations (PDEs). This technique is based on the use of spline-type basis functions, that are able to hold a global smoothness…
Although shape correspondence is a central problem in geometry processing, most methods for this task apply only to two-dimensional surfaces. The neglected task of volumetric correspondence--a natural extension relevant to shapes extracted…
In this article, we discuss the numerical solution of diffusion equations on random surfaces within the isogeometric framework. We describe in detail, how diffusion problems on random surfaces can be modelled and how quantities of interest…
Two maximum likelihood-based algorithms for unfolding or deconvolution are considered: the Richardson-Lucy method and the Data Unfolding method with Mean Integrated Square Error (MISE) optimization [10]. Unfolding is viewed as a procedure…
Core decomposition is a fundamental operator in network analysis. In this paper, we study the problem of computing distance-generalized core decomposition on a network. A distance-generalized core, also termed $(k, h)$-core, is a maximal…