161 research outputs found
Convexity preserving interpolatory subdivision with conic precision
The paper is concerned with the problem of shape preserving interpolatory
subdivision. For arbitrarily spaced, planar input data an efficient non-linear
subdivision algorithm is presented that results in limit curves,
reproduces conic sections and respects the convexity properties of the initial
data. Significant numerical examples illustrate the effectiveness of the
proposed method
Non-uniform interpolatory subdivision schemes with improved smoothness
Subdivision schemes are used to generate smooth curves or surfaces by iteratively refining an initial control polygon or mesh. We focus on univariate, linear, binary subdivision schemes, where the vertices of the refined polygon are computed as linear combinations of the current neighbouring vertices. In the classical stationary setting, there are just two such subdivision rules, which are used throughout all subdivision steps to construct the new vertices with even and odd indices, respectively. These schemes are well understood and many tools have been developed for deriving their properties, including the smoothness of the limit curves. For non-stationary schemes, the subdivision rules are not fixed and can be different in each subdivision step. Non-uniform schemes are even more general, as they allow the subdivision rules to be different for every new vertex that is generated by the scheme. The properties of non-stationary and non-uniform schemes are usually derived by relating the scheme to a corresponding stationary scheme and then exploiting the fact that the properties of the stationary scheme carry over under certain proximity conditions. In particular, this approach can be used to show that the limit curves of a non-stationary or non-uniform scheme are as smooth as those of a corresponding stationary scheme. In this paper we show that non-uniform subdivision schemes have the potential to generate limit curves that are smoother than those of stationary schemes with the same support size of the subdivision rule. For that, we derive interpolatory 2-point and 4-point schemes that generate C-1 and C-2 limit curves, respectively. These values of smoothness exceed the smoothness of classical interpolating schemes with the same support size by one. (C) 2022 The Author(s). Published by Elsevier B.V
Mixed honeycomb pushing refinement
We generalize the honeycomb scheme, dualize it and combine both the primal and the dual scheme into self-dual subdivision schemes for convex polyhedra which generate surfaces without line segments different from the honeycomb scheme, which generates surfaces having line and even planar segments
An interpolating curve subdivision scheme based on discrete first derivative
This paper develops a new scheme of four points for interpolating curve subdivision based on the discrete fi rst derivative (DFDS), which reduces the apparition of undesirable oscillations that can be formed on the limit curve when the control points do not follow a uniform parameterization. We used a set of 3000 curves whose control points were randomly generated. Smooth curves were obtained after seven steps of subdivision using fi ve schemes DFDS, Four-Point (4P), New four-point (N4P), Tight four-point (T4P) and the geometrically controlled scheme (GC4P). The tortuosity property was evaluated on every smooth curve. An analysis for the frequency distributions of this property using the Kruskal-Wallis test reveals that DFDS scheme has the lowest values in a close range
Stochastic collocation on unstructured multivariate meshes
Collocation has become a standard tool for approximation of parameterized
systems in the uncertainty quantification (UQ) community. Techniques for
least-squares regularization, compressive sampling recovery, and interpolatory
reconstruction are becoming standard tools used in a variety of applications.
Selection of a collocation mesh is frequently a challenge, but methods that
construct geometrically "unstructured" collocation meshes have shown great
potential due to attractive theoretical properties and direct, simple
generation and implementation. We investigate properties of these meshes,
presenting stability and accuracy results that can be used as guides for
generating stochastic collocation grids in multiple dimensions.Comment: 29 pages, 6 figure
- …