Related papers: Manifold-valued subdivision schemes based on geode…
We consider geometric Hermite subdivision for planar curves, i.e., iteratively refining an input polygon with additional tangent or normal vector information sitting in the vertices. The building block for the (nonlinear) subdivision…
Consensus algorithms are popular distributed algorithms for computing aggregate quantities, such as averages, in ad-hoc wireless networks. However, existing algorithms mostly address the case where the measurements lie in a Euclidean space.…
In this work we study the general system of geodesic equations for the case of a massive particle moving on an arbitrary curved manifold. The investigation is carried out from the symmetry perspective. By exploiting the parametrization…
Converting quad meshes to smooth manifolds, guided subdivision offers a way to combine the good highlight line distributions of recent G-spline constructions with the refinability of subdivision surfaces. Specifically, we present a C2…
We propose geodesic-based optimization methods on dually flat spaces, where the geometric structure of the parameter manifold is closely related to the form of the objective function. A primary application is maximum likelihood estimation…
In this work, we propose to study the global geometrical properties of generative models. We introduce a new Riemannian metric to assess the similarity between any two data points. Importantly, our metric is agnostic to the parametrization…
We extend the concepts of de Casteljau and de Boor algorithms as well as splines to geodesic spaces and present some applications in geometric modeling. The concept of weighted geometric mean provides another approach to splines. We compare…
In this paper, we give a new construction of the adapted complex structure on a neighborhood of the zero section in the tangent bundle of a compact, real-analytic Riemannian manifold. Motivated by the "complexifier" approach of T. Thiemann…
This paper provides a strategy to analyse the convergence of nonlinear analogues of linear subdivision processes on the sphere. In contrast to previous work, we study the Riemannian analogue of a linear scheme on a Riemannian manifold with…
We show that a totally geodesic submanifold of a symmetric space satisfying certain conditions admits an extension to a minimal submanifold of dimension one higher, and we apply this result to construct new examples of complete embedded…
Convergence properties of binary stationary subdivision schemes for curves have been analyzed using the techniques of z-transforms and eigenanalysis. Eigenanalysis provides a way to determine derivative continuity at specific points based…
Valuations, as additive functionals, allow various applications in Stochastic Geometry, yielding mean value formulas for specific random closed sets and processes of convex or polyconvex particles. In particular, valuations are especially…
Undirected graphical models are a key component in the analysis of complex observational data in a large variety of disciplines. In many of these applications one is interested in estimating the undirected graphical model underlying a…
We develop a formula for tautological integrals over geometric subsets of the Hilbert scheme of points on complex manifolds. As an illustration of the theory, we derive a new iterated residue formula for the number of nodal curves in…
Implicitly described domains are a well established tool in the simulation of time dependent problems, e.g. using level-set methods. In order to solve partial differential equations on such domains, a range of numerical methods was…
Multidimensional scaling (MDS) is a family of methods that embed a given set of points into a simple, usually flat, domain. The points are assumed to be sampled from some metric space, and the mapping attempts to preserve the distances…
From descent theory to higher geometry, the idea of gluing has been embedded in many elegant and powerful techniques, proving instrumental for the solution of many problems. In this paper, we introduce a framework that allows to link…
In this paper we extend the 2D circle average of [11] to a 3D binary average of point-normal pairs, and study its properties. We modify classical surface-generating linear subdivision schemes with this average obtaining surface-generating…
We develop sampling algorithms to fit Bayesian hierarchical models, the computational complexity of which scales linearly with the number of observations and the number of parameters in the model. We focus on crossed random effect and…
Based on an idea in [4] we propose a new iterative multiplicative filtering algorithm for label assignment matrices which can be used for the supervised partitioning of data. Starting with a row-normalized matrix containing the averaged…