Related papers: Subdivision and spline spaces
We characterize the solution of a broad class of convex optimization problems that address the reconstruction of a function from a finite number of linear measurements. The underlying hypothesis is that the solution is decomposable as a…
The output scores of a neural network classifier are converted to probabilities via normalizing over the scores of all competing categories. Computing this partition function, $Z$, is then linear in the number of categories, which is…
The two basic equations satisfied by the parameters of a block design define a three-dimensional affine variety $\mathcal{D}$ in $\mathbb{R}^{5}$. A point of $\mathcal{D}$ that is not in some sense trivial lies on four lines lying in…
Some properties of generalized convexity for sets and for functions are identified in case of the reliability polynomials of two dual minimal networks. A method of approximating the reliability polynomials of two dual minimal network is…
A standard monomial theory for Schubert varieties is constructed exploiting (1) the geometry of the Seshadri stratifications of Schubert varieties by their Schubert subvarieties and (2) the combinatorial LS-path character formula for…
Automatic methods for reconstructing buildings from airborne LiDAR point clouds focus on producing accurate 3D models in a fast and scalable manner, but they overlook the problem of delivering simple and regularized models to practitioners.…
We present a collection of algorithms which utilize dimensional reduction to perform mesh refinement and study possibly singular solutions of time-dependent partial differential equations. The algorithms are inspired by constructions used…
The theory of Chebyshev approximation has been extensively studied. In most cases, the optimality conditions are based on the notion of alternance or alternating sequence (that is, maximal deviation points with alternating deviation signs).…
Classes of simple polynomial and simple trigonometric splines given by Fourier series are considered. It is shown that the class of simple trigonometric splines includes the class of simple polynomial splines. For some parameter values, the…
We define a geometrically meaningful compactification of the moduli space of smooth plane curves, which can be calculated explicitly. The basic idea is to regard a plane curve D in P^2 as a pair (P^2,D) of a surface together with a divisor,…
In the discretization of differential problems on complex geometrical domains, discretization methods based on polygonal and polyhedral elements are powerful tools. Adaptive mesh refinement for such kind of problems is very useful as well…
In this paper we review and refine a technique of Rioul to determine the H\"older regularity of a large class of symmetric subdivision schemes from the spectral radius of a single matrix. These schemes include those of Dubuc and…
Differentiable structure ensures that many of the basics of classical convex analysis extend naturally from Euclidean space to Riemannian manifolds. Without such structure, however, extensions are more challenging. Nonetheless, in…
A systematic and comprehensive study of p-adic refinement equations and subdivision scheme associated with a finitely supported refinement mask are carried out in this paper. The Lq -convergence of the subdivision scheme is characterized in…
A general method is introduced for constructing two-dimensional (2D) surface meshes embedded in three-dimensional (3D) space time, and 3D hypersurface meshes embedded in four-dimensional (4D) space time. In particular, we begin by dividing…
Certain simplicial complexes are used to construct a subset $D$ of $\mathbb{F}_{2^n}^m$ and $D$, in turn, defines the linear code $C_{D}$ over $\mathbb{F}_{2^n}$ that consists of $(v\cdot d)_{d\in D}$ for $v\in \mathbb{F}_{2^n}^m$. Here we…
This study debuts a new spline dimensional decomposition (SDD) for uncertainty quantification analysis of high-dimensional functions, including those endowed with high nonlinearity and nonsmoothness, if they exist, in a proficient manner.…
The paper proposes, an algorithm to produce novel m-point (for any integer m>=2) binary non-stationary subdivision scheme. It has been developed using uniform trigonometric B-spline basis functions and smoothness is being analyzed using the…
Vertical decomposition is a widely used general technique for decomposing the cells of arrangements of semi-algebraic sets in $d$-space into constant-complexity subcells. In this paper, we settle in the affirmative a few long-standing open…
We present a constructive approach for approximating the conformal map (uniformization) of a polyhedral surface to a canonical domain in the plane. The main tool is a characterization of convex spaces of quasiconformal simplicial maps and…