Related papers: Polyhedral Splines for Analysis
In the paper, gridless particle techniques are presented in order to solve problems involving electrostatic, collisionless plasmas. The method makes use of computational particles having the shape of spherical shells or of rings, and can be…
Cubic spline interpolation on Euclidean space is a standard topic in numerical analysis, with countless applications in science and technology. In several emerging fields, for example computer vision and quantum control, there is a growing…
Many scientific fields and applications require compact representations of multivariate functions. For this problem, decoupling methods are powerful techniques for representing the multivariate functions as a combination of linear…
Given a piecewise linear (PL) function $p$ defined on an open subset of $\R^n$, one may construct by elementary means a unique polyhedron with multiplicities $\D(p)$ in the cotangent bundle $\R^n\times \R^{n*}$ representing the graph of the…
Computing a quasi-developable strip surface bounded by design curves finds wide industrial applications. Existing methods compute discrete surfaces composed of developable lines connecting sampling points on input curves which are not…
Splines can be constructed by convolving the indicator function of a cell whose shifts tessellate $\R^k$. This paper presents simple, non-algebraic criteria that imply that, for regular shift-invariant tessellations, only a small subset of…
To deal with non-linear relations between the predictors and the response, we can use transformations to make the data look linear or approximately linear. In practice, however, transformation methods may be ineffective, and it may be more…
We study local and global approximations of smooth nets of curvature lines and smooth conjugate nets by respective discrete nets (circular nets and planar quadrilateral nets) with infinitesimal quads. It is shown that choosing the points of…
Second order spiral splines are $C^2$ unit-speed planar curves that can be used to interpolate a list $Y$ of $n+1$ points in $\R ^2$ at times specified in some list $T$, where $n\geq 2$. Asymptotic methods are used to develop a fast…
In this paper we introduce a $C^1$ spline space over mixed meshes composed of triangles and quadrilaterals, suitable for FEM-based or isogeometric analysis. In this context, a mesh is considered to be a partition of a planar polygonal…
For a d-dimensional polyhedral complex P, the dimension of the space of piecewise polynomial functions (splines) on P of smoothness r and degree k is given, for k sufficiently large, by a polynomial f(P,r,k) of degree d. When d=2 and P is…
Tilings of the plane resemble the simplicial and other complexes from algebraic topology, but have not been studied from this perspective. We construct finite categories corresponding to polygons with labeled directed edges, and introduce…
The shape of crystalline nanoparticles (NP) can often be described by polyhedra with flat facet surfaces. Thus, structural studies of polyhedral bodies can help to describe geometric details of NPs. Here we consider compact polyhedra of…
We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have…
Different techniques from machine learning are applied to the problem of computing line bundle cohomologies of (hypersurfaces in) toric varieties. While a naive approach of training a neural network to reproduce the cohomologies fails in…
In this paper we introduce a new class of diffeomorphic smoothers based on general spline smoothing techniques and on the use of some tools that have been recently developed in the context of image warping to compute smooth diffeomorphisms.…
We introduce discrete analogues of the exponential, sine, and cosine functions. Then using a discrete trigonometric version of a non-polynomial divided difference, we define discrete analogues of the trigonometric B-splines. We derive a…
In this paper, we continue the study of the relation between rational points of rational elliptic surfaces and plane curves. As an application, we give first examples of Zariski pairs of cubic-line arrangements that do not involve…
Introduction of curvilinear coordinates might be very convenient in many cases. Theoretically, tensor analysis would be most suited. However, tensor notation can't be used in numerical procedure. For example, the strict discrimination of…
In applications that involve interactive curve and surface modeling, the intuitive manipulation of shapes is crucial. For instance, user interaction is facilitated if a geometrical object can be manipulated through control points that…