Search results for "Subdivision"
showing 10 items of 52 documents
Multi-scale optimisation vs. genetic algorithms in the gradient separation of diuretics by reversed-phase liquid chromatography
2019
Abstract Multi-linear gradients are a convenient solution to get separation of complex samples by modulating carefully the gradient slope, in order to accomplish the local selectivity needs for each particular solute cluster. These gradients can be designed by trial-and-error according to the chromatographer experience, but this strategy becomes quickly inappropriate for complex separations. More evolved solutions imply the sequential construction of multi-segmented gradients. However, this strategy discards part of the search space in each step of the construction and, again, cannot deal properly with very complex samples. When the complexity is too large, the only valid alternative for fi…
Smooth 4-Dimensional Thickening of Singular 2-Dimensional Complex in the non Compact Case.
2009
L'articolo estende la teoria dell'ingrossamento 4-dimensionale nel caso non-proprio.
OPTIMIZATIONS FOR TENSORIAL BERNSTEIN–BASED SOLVERS BY USING POLYHEDRAL BOUNDS
2010
The tensorial Bernstein basis for multivariate polynomials in n variables has a number 3n of functions for degree 2. Consequently, computing the representation of a multivariate polynomial in the tensorial Bernstein basis is an exponential time algorithm, which makes tensorial Bernstein-based solvers impractical for systems with more than n = 6 or 7 variables. This article describes a polytope (Bernstein polytope) with a number of faces, which allows to bound a sparse, multivariate polynomial expressed in the canonical basis by solving several linear programming problems. We compare the performance of a subdivision solver using domain reductions by linear programming with a solver using a c…
Geometry control of the junction between two fractal curves
2012
International audience; The general objective of our work is to create a geometric modeller based on iterative processes. With this objective in mind, we have to provide tools that work with fractal objects in the same manner as with objects of classical topology. In this article we focus on the constructing of an intermediate curve between two other curves defined by different iterative construction processes. A similar problem often arises with subdivision surfaces, when the goal is to connect two surfaces with different subdivision masks. We start by dealing with curves, willing to later generalise our approach to surfaces. We formalise the problem with the Boundary Controlled Iterated F…
Joining primal/dual subdivision surfaces
2012
International audience; In this article we study the problem of constructing an intermediate surface between two other surfaces defined by different iterative construction processes. This problem is formalised with Boundary Controlled Iterated Function System model. The formalism allows us to distinguish between subdivision of the topology and subdivision of the mesh. Although our method can be applied to surfaces with quadrangular topology subdivision, it can be used with any mesh subdivision (primal scheme, dual scheme or other.) Conditions that guarantee continuity of the intermediate surface determine the structure of subdivision matrices. Depending on the nature of the initial surfaces…
On the use of generalized harmonic means in image processing using multiresolution algorithms
2019
In this paper we design a family of cell-average nonlinear prediction operators that make use of the generalized harmonic means and we apply the resulting schemes to image processing. The new famil...
Revisited mixed-value method via symmetric BEM in the substructuring approach
2012
Abstract Within the Symmetric Boundary Element Method, the mixed-value analysis is re-formulated. This analysis method contemplates the subdivision of the body into substructures having interface kinematical and mechanical quantities. For each substructure an elasticity equation, connecting weighted displacements and tractions to nodal displacements and forces of the same interface boundary and to external action vector, is introduced. The assembly of the substructures is performed through both the strong and weak regularity conditions of the displacements and tractions. We obtain the solving equations where the compatibility and the equilibrium are guaranteed in the domain Ω for the use of…
Iterative constructions of central conic arcs using non-stationary IFS
2012
Several methods of subdivision exist to build parabola arcs or circle arcs in the usual Euclidean affine plane. Using a compass and a ruler, it is possible to construct, from three weighted points, circles arcs in the affine space without projective considerations. This construction is based on rational quadratic Bézier curve properties. However, when the conic is an ellipse or a hyperbola, the weight computation is relatively hard. As the equation of a conic is $\qaff(x,y)=1$, where $\qaff$ is a quadratic form, one can use the pseudo-metric associed to $\qaff$ in the affine plane and then, the conic geometry is also handled as an Euclidean circle. At each step of the iterative algorithm, t…
Fast Computation by Subdivision of Multidimensional Splines and Their Applications
2016
We present theory and algorithms for fast explicit computations of uni- and multi-dimensional periodic splines of arbitrary order at triadic rational points and of splines of even order at diadic rational points. The algorithms use the forward and the inverse Fast Fourier transform (FFT). The implementation is as fast as FFT computation. The algorithms are based on binary and ternary subdivision of splines. Interpolating and smoothing splines are used for a sample rate convertor such as resolution upsampling of discrete-time signals and digital images and restoration of decimated images that were contaminated by noise. The performance of the rate conversion based spline is compared with the…
Verification of IRRILAB Software Application for the Hydraulic Design of a Micro-Irrigation System by Using IRRIPRO for an Apple Farm in Sicily
2021
In recent years, many studies have been performed to develop simple and accurate methods to design micro-irrigation systems. However, most of these studies are based on numerical solutions that require a high number of iterations and attempts, without ensuring to maximize water use efficiency and energy-saving. Recently, the IRRILAB software, which is based on an analytical approach to optimally design rectangular micro-irrigation units, has been developed, providing the solution corresponding to the maximum energy-saving condition, for any slope of the laterals and of the manifold. One IRRILAB limitation is that, according to its theoretical basis, the rectangular planform geometry and uni…