512 research outputs found
Near-best 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 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
Polynomial Meshes: Computation and Approximation
We present the software package WAM, written in Matlab, that generates Weakly
Admissible Meshes and Discrete Extremal Sets of Fekete and Leja type, for 2d and 3d
polynomial least squares and interpolation on compact sets with various geometries.
Possible applications range from data fitting to high-order methods for PDEs
Subperiodic Dubiner distance, norming meshes and trigonometric polynomial optimization
We extend the notion of Dubiner distance from algebraic to trigonometric polynomials on subintervals of the period, and we obtain its explicit form by the Szego variant of Videnskii inequality. This allows to improve previous estimates for Chebyshev-like trigonometric norming meshes, and suggests a possible use of such meshes in the framework of multivariate polynomial optimization on regions defined by circular arcs
Constructing IGA-suitable planar parameterization from complex CAD boundary by domain partition and global/local optimization
In this paper, we propose a general framework for constructing IGA-suitable
planar B-spline parameterizations from given complex CAD boundaries consisting
of a set of B-spline curves. Instead of forming the computational domain by a
simple boundary, planar domains with high genus and more complex boundary
curves are considered. Firstly, some pre-processing operations including
B\'ezier extraction and subdivision are performed on each boundary curve in
order to generate a high-quality planar parameterization; then a robust planar
domain partition framework is proposed to construct high-quality patch-meshing
results with few singularities from the discrete boundary formed by connecting
the end points of the resulting boundary segments. After the topology
information generation of quadrilateral decomposition, the optimal placement of
interior B\'ezier curves corresponding to the interior edges of the
quadrangulation is constructed by a global optimization method to achieve a
patch-partition with high quality. Finally, after the imposition of
C1=G1-continuity constraints on the interface of neighboring B\'ezier patches
with respect to each quad in the quadrangulation, the high-quality B\'ezier
patch parameterization is obtained by a C1-constrained local optimization
method to achieve uniform and orthogonal iso-parametric structures while
keeping the continuity conditions between patches. The efficiency and
robustness of the proposed method are demonstrated by several examples which
are compared to results obtained by the skeleton-based parameterization
approach
- …