Near-best C2C^2 quartic spline quasi-interpolants on type-6 tetrahedral partitions of bounded domains

In this paper, we present new quasi-interpolating spline schemes defined on 3D bounded domains, based on trivariate $C^2$ quartic box splines on type-6 tetrahedral partitions and with approximation order four. Such methods can be used for the reconstruction of gridded volume data. More precisely, we propose near-best quasi-interpolants, i.e. with coefficient functionals obtained by imposing the exactness of the quasi-interpolants on the space of polynomials of total degree three and minimizing an upper bound for their infinity norm. In case of bounded domains the main problem consists in the construction of the coefficient functionals associated with boundary generators (i.e. generators with supports not completely inside the domain), so that the functionals involve data points inside or on the boundary of the domain. We give norm and error estimates and we present some numerical tests, illustrating the approximation properties of the proposed quasi-interpolants, and comparisons with other known spline methods. Some applications with real world volume data are also provided.Comment: In the new version of the paper, we have done some minor revisions with respect to the previous version, CALCOLO, Published online: 10 October 201

Reducing the number of templates for aligned-spin compact binary coalescence gravitational wave searches using metric-agnostic template nudging

Efficient multi-dimensional template placement is crucial in computationally intensive matched-filtering searches for Gravitational Waves (GWs). Here, we implement the Neighboring Cell Algorithm (NCA) to improve the detection volume of an existing Compact Binary Coalescence (CBC) template bank. This algorithm has already been successfully applied for a binary millisecond pulsar search in data from the Fermi satellite. It repositions templates from over-dense regions to under-dense regions and reduces the number of templates that would have been required by a stochastic method to achieve the same detection volume. Our method is readily generalizable to other CBC parameter spaces. Here we apply this method to the aligned--single-spin neutron-star--black-hole binary coalescence inspiral-merger-ringdown gravitational wave parameter space. We show that the template nudging algorithm can attain the equivalent effectualness of the stochastic method with 12% fewer templates

Computing and Displaying Isosurfaces in R

This paper presents R utilities for computing and displaying isosurfaces, or three-dimensional contour surfaces, from a three-dimensional array of function values. A version of the marching cubes algorithm that takes into account face and internal ambiguities is used to compute the isosurfaces. Vectorization is used to ensure adequate performance using only R code. Examples are presented showing contours of theoretical densities, density estimates, and medical imaging data. Rendering can use the rgl package or standard or grid graphics, and a set of tools for representing and rendering surfaces using standard or grid graphics is presented.

Symmetric Instantons and Skyrme Fields

By explicit construction of the ADHM data, we prove the existence of a charge seven instanton with icosahedral symmetry. By computing the holonomy of this instanton we obtain a Skyrme field which approximates the minimal energy charge seven Skyrmion. We also present a one parameter family of tetrahedrally symmetric instantons whose holonomy gives a family of Skyrme fields which models a Skyrmion scattering process, where seven well-separated Skyrmions collide to form the icosahedrally symmetric Skyrmion.Comment: 22 pages plus 1 figure in GIF forma

Designing Volumetric Truss Structures

We present the first algorithm for designing volumetric Michell Trusses. Our method uses a parametrization approach to generate trusses made of structural elements aligned with the primary direction of an object's stress field. Such trusses exhibit high strength-to-weight ratios. We demonstrate the structural robustness of our designs via a posteriori physical simulation. We believe our algorithm serves as an important complement to existing structural optimization tools and as a novel standalone design tool itself

Computing and Displaying Isosurfaces in R

This paper presents R utilities for computing and displaying isosurfaces, or three-dimensional contour surfaces, from a three-dimensional array of function values. A version of the marching cubes algorithm that takes into account face and internal ambiguities is used to compute the isosurfaces. Vectorization is used to ensure adequate performance using only R code. Examples are presented showing contours of theoretical densities, density estimates, and medical imaging data. Rendering can use the rgl package or standard or grid graphics, and a set of tools for representing and rendering surfaces using standard or grid graphics is presented