Related papers: Blocking of Dynamical Triangulations with Matter
The original models of causal dynamical triangulations construct space-time by arranging a set of simplices in layers separated by a fixed time-like distance. The importance of the foliation structure in the 2+1 dimensional model is studied…
This paper investigates a computational strategy for studying the interactions between multiple through-the-width delaminations and global or local buckling in composite laminates taking into account possible contact between the delaminated…
We present a novel AI-assisted method for decomposing (segmenting) planar CAD (computer-aided design) models into well shaped rectangular blocks as a proof-of-principle of a general decomposition method applicable to complex 2D and 3D CAD…
This work is concerned with a representation of shapes that disentangles fine, local and possibly repeating geometry, from global, coarse structures. Achieving such disentanglement leads to two unrelated advantages: i) a significant…
In a recent paper, a new method was proposed to find the common invariant subspaces of a set of matrices. This paper invstigates the more general problem of putting a set of matrices into block triangular or block-diagonal form…
We present a hierarchically blocked one-sided Jacobi algorithm for the singular value decomposition (SVD), targeting both single and multiple graphics processing units (GPUs). The blocking structure reflects the levels of GPU's memory…
Dissipative phenomena manifest in multiple mechanical systems. In this dissertation, different geometric frameworks for modelling non-conservative dynamics are considered. The objective is to generalize several results from conservative…
In this paper, we design robust and efficient block preconditioners for the two-field formulation of Biot's consolidation model, where stabilized finite-element discretizations are used. The proposed block preconditioners are based on the…
We develop a block-activated decomposition algorithm for multi-stage stochastic variational inequalities with nonanticipativity constraints, which features two computational novelties: (i) At each iteration, our method activates only a…
The intricate interplay between colloidal particle shape and precisely engineered interaction potentials has paved the way for the discovery of unprecedented crystal structures in both two and three dimensions. Here, we make use of…
We describe some theoretical results on triangulations of surfaces and we develop a theory on roots, decompositions and genus-surfaces. We apply this theory to describe an algorithm to list all triangulations of closed surfaces with at most…
The friction force observed at macroscale is the result of interactions at various lower length scales that are difficult to model in a combined manner. For this reason, simplified approaches are required, depending on the specific aspect…
The output of molecular dynamics simulations is high-dimensional, and the degrees of freedom among the atoms are related in intricate ways. Therefore, a variety of analysis frameworks have been introduced in order to distill complex motions…
We present a novel technique for encoding and decoding constant weight binary codes that uses a geometric interpretation of the codebook. Our technique is based on embedding the codebook in a Euclidean space of dimension equal to the weight…
Block-matching and 3D filtering (BM3D) is an image denoising algorithm that works in two similar steps. Both of these steps need to perform grouping by block-matching. We implement the block-matching in an FPGA, leveraging its ability to…
The so-called motorcycle graph has been employed in recent years for various purposes in the context of structured and aligned block decomposition of 2D shapes and 2-manifold surfaces. Applications are in the fields of surface…
In this paper, we explore a specific optimization problem that combines a differentiable nonconvex function with a nondifferentiable function for multi-block variables, which is particularly relevant to tackle the multilinear…
Superconvergence of differential structure on discretized surfaces is studied in this paper. The newly introduced geometric supercloseness provides us with a fundamental tool to prove the superconvergence of gradient recovery on deviated…
Current mesh reduction techniques, while numerous, all primarily reduce mesh size by successive element deletion (e.g. edge collapses) with the goal of geometric and topological feature preservation. The choice of geometric error used to…
In this paper, a new steganographic method is presented that provides minimum distortion in the stego image. The proposed encoding algorithm focuses on DCT rounding error and optimizes that in a way to reduce distortion in the stego image,…