相关论文: Generic Smooth Connection Functions - A New Analyt…

We propose a novel 3D shape correspondence method based on the iterative alignment of so-called smooth shells. Smooth shells define a series of coarse-to-fine shape approximations designed to work well with multiscale algorithms. The main…

We present a nodal interpolation method to approximate a subdivision model. The main application is to model and represent curved geometry without gaps and preserving the required simulation intent. Accordingly, we devise the technique to…

The correlation functions for models of minimal gravity are discussed. An algorithm is proposed for calculations of invariant ratios from formulas of residues that can be compared with the coefficients of expansion of the partition function…

We define a new notion of total curvature, called net total curvature, for finite graphs embedded in Rn, and investigate its properties. Two guiding principles are given by Milnor's way of measuring the local crookedness of a Jordan curve…

Towards identifying the number of minimal surfaces sharing the same boundary from the geometry of the boundary, we propose a numerical scheme with high speed and high accuracy. Our numerical scheme is based on the method of fundamental…

Curve shortening in the $z$-plane in which, at a given point on the curve, the normal velocity of the curve is equal to the curvature, is shown to satisfy $S_tS_z=S_{zz}$, where $S(z,t)$ is the Schwarz function of the curve. This equation…

We compute curvature-dependent graviton correlation functions and couplings as well as the full curvature potential $f(R)$ in asymptotically safe quantum gravity coupled to scalars. The setup is based on a systematic vertex expansion about…

Families of conformal field theories are naturally endowed with a Riemannian geometry which is locally encoded by correlation functions of exactly marginal operators. We show that the curvature of such conformal manifolds can be computed…

In this paper we develop methods to extend the minimal hypersurface approach to positive scalar curvature problems to all dimensions. This includes a proof of the positive mass theorem in all dimensions without a spin assumption. It also…

We explore the pressure of active particles on curved surfaces and its relation to other interfacial properties. We use both direct simulations of the active systems as well as simulations of an equilibrium system with effective (pair)…

We consider a system of three surfaces, graphs over a bounded domain in ${\mathbb R}^2$, intersecting along a time-dependent curve and moving by mean curvature while preserving the pairwise angles at the curve of intersection (equal to…

We consider the problem of finding curves of minimum pointwise-maximum curvature, i.e., curves of minimax curvature, among planar curves of fixed length with prescribed endpoints and tangents at the endpoints. We reformulate the problem in…

Many inverse problems and signal processing problems involve low-rank regularizers based on the nuclear norm. Commonly, proximal gradient methods (PGM) are adopted to solve this type of non-smooth problems as they can offer fast and…

The vertex connectivity of a graph $G$ is the size of the smallest set of vertices $S$ such that $G \setminus S$ is disconnected. For the class of planar graphs, the problem of vertex connectivity is well-studied, both from structural and…

Vertex connectivity and edge connectivity are fundamental concepts in graph theory that have been widely studied from both structural and algorithmic perspectives. The focus of this paper is on computing these two parameters for graphs…

We show how to define curvature as a measure using the Gauss-Bonnet Theorem on a family of singular surfaces obtained by gluing together smooth surfaces along boundary curves. We find an explicit formula for the curvature measure as a sum…

Generalizing the well-known relations on characteristic functions on a plane to the case of a one-dimensional regular surface (curve) with compact support, we establish implicit equations for these functions. Introducing an approximation,…

We introduce a new approach for computing curvature of sub-Riemannian manifolds. Curvature is here meant as symplectic invariants of Jacobi curves of geodesics, as introduced by Zelenko and Li. We describe how they can be expressed using a…

We consider the problem of finding critical points of functions that are non-convex and non-smooth. Studying a fairly broad class of such problems, we analyze the behavior of three gradient-based methods (gradient descent, proximal update,…

By a symmetric double graph we mean a hypersurface which is mirror-symmetric and the two symmetric parts are graphs over the hyperplane of symmetry. We prove that there is a weak solution of mean curvature flow that preserves these…