Related papers: Generic Smooth Connection Functions - A New Analyt…
Image smoothing is a fundamental procedure in applications of both computer vision and graphics. The required smoothing properties can be different or even contradictive among different tasks. Nevertheless, the inherent smoothing nature of…
Exploiting the variational interpretation of kernel interpolation we exhibit a direct connection between interpolation and regression, where interpolation appears as a limiting case of regression. By applying this framework to point clouds…
Andrews plots provide aesthetically pleasant visualizations of high-dimensional datasets. This work proves that Andrews plots (when defined in terms of the principal component scores of a dataset) are optimally ``smooth'' on average, and…
We study the problem of finding the one-dimensional structure in a given data set. In other words we consider ways to approximate a given measure (data) by curves. We consider an objective functional whose minimizers are a regularization of…
Let $(M^{n},g_{0})$ be a $n=3,4,5$ dimensional, closed Riemannian manifold of positive Yamabe invariant. For a smooth function $K>0$ on $M$ we consider a scalar curvature flow, that tends to prescribe $K$ as the scalar curvature of a metric…
For the $p$-harmonic function with strictly convex level sets, we find a test function which comes from the combination of the norm of gradient of the $p$-harmonic function and the smallest principal curvature of the level sets of…
We study the problem of finding a triangulation T of a planar point set S such as to minimize the expected distance between two points x and y chosen uniformly at random from S. By distance we mean the length of the shortest path between x…
We survey some results on scalar curvature and properties of solutions to the Einstein constraint equations. Topics include an extended discussion of asymptotically flat solutions to the constraint equations, including recent results on the…
This paper studies the classical water wave problem with vorticity described by the Euler equations with a free surface under the influence of gravity over a flat bottom. Based on fundamental work \cite{ConstantinStrauss}, we first obtain…
The quantitative characterization of the microstructure of random heterogeneous media in $d$-dimensional Euclidean space $\mathbb{R}^d$ via a variety of $n$-point correlation functions is of great importance, since the respective infinite…
Vacuum quasi-topological gravity with infinitely many terms in the action satisfies Markov's limiting curvature hypothesis: the spherically symmetric solutions are regular and all curvature invariants are bounded by solution-independent…
In this article, we provide new structural results and algorithms for the Homotopy Height problem. In broad terms, this problem quantifies how much a curve on a surface needs to be stretched to sweep continuously between two positions. More…
This study introduces a procedure to obtain general expressions, $y = f(x)$, subject to linear constraints on the function and its derivatives defined at specified values. These constrained expressions can be used describe functions with…
This work is based upon a coupled, lattice-based continuum formulation that was previously applied to problems involving strong coupling between mechanics and mass transport; e.g. diffusional creep and electromigration. Here we discuss an…
We generalize Newton-type methods for minimizing smooth functions to handle a sum of two convex functions: a smooth function and a nonsmooth function with a simple proximal mapping. We show that the resulting proximal Newton-type methods…
Given two points in the plane, and a set of "obstacles" given as curves through the plane with assigned weights, we consider the point-separation problem, which asks for the minimum-weight subset of the obstacles separating the two points.…
Composite optimization problems, where the sum of a smooth and a merely lower semicontinuous function has to be minimized, are often tackled numerically by means of proximal gradient methods as soon as the lower semicontinuous part of the…
We study two fundamental problems dealing with curves in the plane, namely, the nearest-neighbor problem and the center problem. Let $\mathcal{C}$ be a set of $n$ polygonal curves, each of size $m$. In the nearest-neighbor problem, the goal…
A novel algorithm is proposed for quantitative comparisons between compact surfaces embedded in the three-dimensional Euclidian space. The key idea is to identify those objects with the associated surface measures and compute a weak…
We investigate the logarithmic convexity of the length of the level curves for harmonic functions on surfaces and related isoperimetric type inequalities. The results deal with smooth surfaces, as well as with singular Alexandrov surfaces…