Related papers: Polyhedral Splines for Analysis
Analysis-suitable $G^1$ (AS-$G^1$) multi-patch spline surfaces [4] are particular $G^1$-smooth multi-patch spline surfaces, which are needed to ensure the construction of $C^1$-smooth multi-patch spline spaces with optimal polynomial…
We investigate the common underlying discrete structures for various smooth and discrete nets. The main idea is to impose the characteristic properties of the nets not only on elementary quadrilaterals but also on larger parameter…
In this paper a local Fourier analysis for multigrid methods on tetrahedral grids is presented. Different smoothers for the discretization of the Laplace operator by linear finite elements on such grids are analyzed. A four-color smoother…
We study the shape of inflated surfaces introduced in \cite{B1} and \cite{P1}. More precisely, we analyze profiles of surfaces obtained by inflating a convex polyhedron, or more generally an almost everywhere flat surface, with a symmetry…
Computing occluding contours is a key building block of non-photorealistic rendering, but producing contours with consistent visibility has been notoriously challenging. This paper describes the first general-purpose smooth surface…
Finite trigonometric Fourier series on a set of discrete equidistant points are considered. A finite system of orthogonal functions that have interpolation and certain differential properties on the period is introduced. Finite Fourier…
In this paper we deduce new characterizations for bivariate Bessel-Potential spaces defined on the unit square via B-spline quarklets. For that purpose in a first step we use univariate boundary adapted quarklets to describe univariate…
We present a polyhedral algorithm to manipulate positive dimensional solution sets. Using facet normals to Newton polytopes as pretropisms, we focus on the first two terms of a Puiseux series expansion. The leading powers of the series are…
BSplines are one of the most promising curves in computer graphics. They are blessed with some superior geometric properties which make them an ideal candidate for several applications in computer aided design industry. In this article,…
Golodness of 2-dimensional simplicial complexes is studied through polyhedral products, and combinatorial and topoogical characterization of Golodness of surface triangulations is given. An answer to the question of Berglund is also given…
We consider an elliptic optimal control problem where the objective functional contains an integral along a surface of codimension 1, also known as a hypersurface. In particular, we use a fidelity term that encourages the state to take…
We present a method for designing smooth cross fields on surfaces that automatically align to sharp features of an underlying geometry. Our approach introduces a novel class of energies based on a representation of cross fields in the…
Geometry processing presents a variety of difficult numerical problems, each seeming to require its own tailored solution. This breadth is largely due to the expansive list of geometric primitives, e.g., splines, triangles, and hexahedra,…
Under consideration methods of constructing trigonometric interpolation splines of two variables on rectangular areas. These methods are easily generalized to the case of trigonometric interpolation splines of several variables on such…
Computing control invariant sets is paramount in many applications. The families of sets commonly used for computations are ellipsoids and polyhedra. However, searching for a control invariant set over the family of ellipsoids is…
We introduce a smooth B-spline discretization in polar coordinates on the unit disc that corrects the loss of regularity present at the origin caused by the coordinate singularity in standard tensor-product B-spline formulations. The method…
Tile B-splines in $\mathbb{R}^d$ are defined as autoconvolutions of the indicators of tiles, which are special self-similar compact sets whose integer translates tile the space $\mathbb{R}^d$. These functions are not piecewise-polynomial,…
In a previous work of the authors, a result to algorithmically compute the topology types of the level curves of an algebraic surface, is given. From this result, here we derive applications based on level curves to determine some…
The goal of this study is to provide a method for computing the following: Given a network of curves in 3d (satisfying a condition at the intersection points), compute efficiently a smooth surface such that the curves are geodesics on it.…
Semialgebraic splines are bivariate splines over meshes whose edges are arcs of algebraic curves. They were first considered by Wang, Chui, and Stiller. We compute the dimension of the space of semialgebraic splines in two extreme cases. If…