1,327 research outputs found
Approximation and geometric modeling with simplex B-splines associated with irregular triangles
Bivariate quadratic simplical B-splines defined by their corresponding set of knots derived from a (suboptimal) constrained Delaunay triangulation of the domain are employed to obtain a C1-smooth surface. The generation of triangle vertices is adjusted to the areal distribution of the data in the domain. We emphasize here that the vertices of the triangles initially define the knots of the B-splines and do generally not coincide with the abscissae of the data. Thus, this approach is well suited to process scattered data.\ud
\ud
With each vertex of a given triangle we associate two additional points which give rise to six configurations of five knots defining six linearly independent bivariate quadratic B-splines supported on the convex hull of the corresponding five knots.\ud
\ud
If we consider the vertices of the triangulation as threefold knots, the bivariate quadratic B-splines turn into the well known bivariate quadratic Bernstein-BĂ©zier-form polynomials on triangles. Thus we might be led to think of B-splines as of smoothed versions of Bernstein-BĂ©zier polynomials with respect to the entire domain. From the degenerate Bernstein-BĂ©zier situation we deduce rules how to locate the additional points associated with each vertex to establish knot configurations that allow the modeling of discontinuities of the function itself or any of its directional derivatives. We find that four collinear knots out of the set of five defining an individual quadratic B-spline generate a discontinuity in the surface along the line they constitute, and that analogously three collinear knots generate a discontinuity in a first derivative.\ud
Finally, the coefficients of the linear combinations of normalized simplicial B-splines are visualized as geometric control points satisfying the convex hull property.\ud
Thus, bivariate quadratic B-splines associated with irregular triangles provide a great flexibility to approximate and model fast changing or even functions with any given discontinuities from scattered data.\ud
An example for least squares approximation with simplex splines is presented
Bivariate Hermite subdivision
A subdivision scheme for constructing smooth surfaces interpolating scattered data in is proposed. It is also possible to impose derivative constraints in these points. In the case of functional data, i.e., data are given in a properly triangulated set of points from which none of the pairs and with coincide, it is proved that the resulting surface (function) is . The method is based on the construction of a sequence of continuous splines of degree 3. Another subdivision method, based on constructing a sequence of splines of degree 5 which are once differentiable, yields a function which is if the data are not 'too irregular'. Finally the approximation properties of the methods are investigated
Monotonicity preserving approximation of multivariate scattered data
This paper describes a new method of monotone interpolation and smoothing of multivariate scattered data. It is based on the assumption that the function to be approximated is Lipschitz continuous. The method provides the optimal approximation in the worst case scenario and tight error bounds. Smoothing of noisy data subject to monotonicity constraints is converted into a quadratic programming problem. Estimation of the unknown Lipschitz constant from the data by sample splitting and cross-validation is described. Extension of the method for locally Lipschitz functions is presented.<br /
Aspects of Unstructured Grids and Finite-Volume Solvers for the Euler and Navier-Stokes Equations
One of the major achievements in engineering science has been the development of computer algorithms for solving nonlinear differential equations such as the Navier-Stokes equations. In the past, limited computer resources have motivated the development of efficient numerical schemes in computational fluid dynamics (CFD) utilizing structured meshes. The use of structured meshes greatly simplifies the implementation of CFD algorithms on conventional computers. Unstructured grids on the other hand offer an alternative to modeling complex geometries. Unstructured meshes have irregular connectivity and usually contain combinations of triangles, quadrilaterals, tetrahedra, and hexahedra. The generation and use of unstructured grids poses new challenges in CFD. The purpose of this note is to present recent developments in the unstructured grid generation and flow solution technology
TVL<sub>1</sub> Planarity Regularization for 3D Shape Approximation
The modern emergence of automation in many industries has given impetus to extensive research into mobile robotics. Novel perception technologies now enable cars to drive autonomously, tractors to till a field automatically and underwater robots to construct pipelines. An essential requirement to facilitate both perception and autonomous navigation is the analysis of the 3D environment using sensors like laser scanners or stereo cameras. 3D sensors generate a very large number of 3D data points when sampling object shapes within an environment, but crucially do not provide any intrinsic information about the environment which the robots operate within.
This work focuses on the fundamental task of 3D shape reconstruction and modelling from 3D point clouds. The novelty lies in the representation of surfaces by algebraic functions having limited support, which enables the extraction of smooth consistent implicit shapes from noisy samples with a heterogeneous density. The minimization of total variation of second differential degree makes it possible to enforce planar surfaces which often occur in man-made environments. Applying the new technique means that less accurate, low-cost 3D sensors can be employed without sacrificing the 3D shape reconstruction accuracy
Exact asymptotics of the uniform error of interpolation by multilinear splines
The question of adaptive mesh generation for approximation by splines has
been studied for a number of years by various authors. The results have
numerous applications in computational and discrete geometry, computer aided
geometric design, finite element methods for numerical solutions of partial
differential equations, image processing, and mesh generation for computer
graphics, among others. In this paper we will investigate the questions
regarding adaptive approximation of C2 functions with arbitrary but fixed
throughout the domain signature by multilinear splines. In particular, we will
study the asymptotic behavior of the optimal error of the weighted uniform
approximation by interpolating and quasi-interpolating multilinear splines
Boussinesq Systems of Bona-Smith Type on Plane Domains: Theory and Numerical Analysis
We consider a class of Boussinesq systems of Bona-Smith type in two space
dimensions approximating surface wave flows modelled by the three-dimensional
Euler equations. We show that various initial-boundary-value problems for these
systems, posed on a bounded plane domain are well posed locally in time. In the
case of reflective boundary conditions, the systems are discretized by a
modified Galerkin method which is proved to converge in at an optimal
rate. Numerical experiments are presented with the aim of simulating
two-dimensional surface waves in complex plane domains with a variety of
initial and boundary conditions, and comparing numerical solutions of
Bona-Smith systems with analogous solutions of the BBM-BBM system
Hierarchical Riesz bases for Hs(Omega), 1 < s < 5/2
On arbitrary polygonal domains , we construct hierarchical Riesz bases for Sobolev spaces . In contrast to an earlier construction by Dahmen, Oswald, and Shi (1994), our bases will be of Lagrange instead of Hermite type, by which we extend the range of stability from to . Since the latter range includes , with respect to the present basis, the stiffness matrices of fourth-order elliptic problems are uniformly well-conditioned
Adaptive BEM with optimal convergence rates for the Helmholtz equation
We analyze an adaptive boundary element method for the weakly-singular and
hypersingular integral equations for the 2D and 3D Helmholtz problem. The
proposed adaptive algorithm is steered by a residual error estimator and does
not rely on any a priori information that the underlying meshes are
sufficiently fine. We prove convergence of the error estimator with optimal
algebraic rates, independently of the (coarse) initial mesh. As a technical
contribution, we prove certain local inverse-type estimates for the boundary
integral operators associated with the Helmholtz equation
- …