Related papers: Surface Triangulation -- The Metric Approach
The aim of this paper is to associate a measure for certain sets of paths in the Euclidean plane $\mathbb{R}^2$ with fixed starting and ending points. Then, working on parameterized surfaces with a specific Riemannian metric, we define and…
We study the approximability of general convex sets in $\mathbb{R}^n$ by intersections of halfspaces, where the approximation quality is measured with respect to the standard Gaussian distribution $N(0,I_n)$ and the complexity of an…
We describe how to approximate the Riemann curvature tensor as well as sectional curvatures on possibly infinite-dimensional shape spaces that can be thought of as Riemannian manifolds. To this end, we extend the variational time…
Mixture models, such as Gaussian mixture models, are widely used in machine learning to represent complex data distributions. A key challenge, especially in high-dimensional settings, is to determine the mixture order and estimate the…
Geometric rounding of a mesh is the task of approximating its vertex coordinates by floating point numbers while preserving mesh structure. Geometric rounding allows algorithms of computational geometry to interface with numerical…
Geometry of hypersurfaces defined by the relation which generalizes classical formula for free energy in terms of microstates is studied. Induced metric, Riemann curvature tensor, Gauss-Kronecker curvature and associated entropy are…
We describe an efficient algorithm to compute a conformally equivalent metric for a discrete surface, possibly with boundary, exhibiting prescribed Gaussian curvature at all interior vertices and prescribed geodesic curvature along the…
How good is a triangulation as an approximation of a smooth curved surface or manifold? We provide bounds on the {\em interpolation error}, the error in the position of the surface, and the {\em normal error}, the error in the normal…
Any procedure applied to data, and any quantity derived from data, is required to respect the nature and symmetries of the data. This axiom applies to refinement procedures and multiresolution transforms as well as to more basic operations…
An affine factorable surface of the second kind in the three dimensional pseudo-Galilean space G13 is studied depending on the invariant theory and theory of differential equation. The first and second fundamental forms, Gaussian curvature…
In the process of projecting the surface of a three-dimensional object onto a two-dimensional surface, due to the perspective distortion, the image on the surface of the object will have different degrees of distortion according to the…
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…
We study surfaces with a constant ratio of principal curvatures in Euclidean and simply isotropic geometries and characterize rotational, channel, ruled, helical, and translational surfaces of this kind under some technical restrictions…
This paper presents a high-order accurate numerical quadrature algorithm for evaluating integrals over curved surfaces and regions defined implicitly via a level set of a given function restricted to a hyperrectangle. The domain is divided…
The Bayesian smoothing equations are generally intractable for systems described by nonlinear stochastic differential equations and discrete-time measurements. Gaussian approximations are a computationally efficient way to approximate the…
How do we characterize the shape of a surface? It is now well understood that the shape of a surface is determined by measuring how curved it is at each point. From these measurements, one can identify the directions of largest and smallest…
In [21] the evolution of hypersurfaces in $\mathbb{R}^{n+1}$ with normal speed equal to a power $k>1$ of the mean curvature is considered and the levelset solution $u$ of the flow is obtained as the $C^0$-limit of a sequence $u^{\epsilon}$…
The notions of discrete conformality on triangle meshes have rich mathematical theories and wide applications. The related notions of discrete uniformizations on triangle meshes, suggest efficient methods for computing the uniformizations…
We propose a method to enhance 3D Gaussian Splatting (3DGS)~\cite{Kerbl2023}, addressing challenges in initialization, optimization, and density control. Gaussian Splatting is an alternative for rendering realistic images while supporting…
In this paper we study algorithms to find a Gaussian approximation to a target measure defined on a Hilbert space of functions; the target measure itself is defined via its density with respect to a reference Gaussian measure. We employ the…