相关论文: Testing surface area with arbitrary accuracy
Random packing of unoriented regular polygons and star polygons on a two-dimensional flat, continuous surface is studied numerically using random sequential adsorption algorithm. Obtained results are analyzed to determine saturated random…
Surface parameterization is a fundamental concept in fields such as differential geometry and computer graphics. It involves mapping a surface in three-dimensional space onto a two-dimensional parameter space. This process allows for the…
The simplicial complexity is an invariant for finitely presentable groups that was recently introduced by Babenko, Balacheff and Bulteau to study systolic area. The simplicial complexity $\kappa(G)$ was proved to be a good approximation of…
Given a real symmetric positive semi-definite matrix E, and an approximation S that is a sum of n independent matrix-valued random variables, we present bounds on the relative error in S due to randomization. The bounds do not depend on the…
The Sphere Covering Inequality was introduced in \cite{GM} (\emph{Invent. Math.}, 2018) as a sharp geometric inequality that provides a lower bound for the total area of two distinct surfaces of Gaussian curvature 1. These surfaces are…
In this note, we prove that for every $0<\sigma<1$, there exists a smooth complete hypersurface $\Sigma$ in $\mathbb{H}^{n+1}$ with prescribed asymptotic boundary $\partial \Sigma=\Gamma$ at infinity, whose principal curvatures…
A perturbative technique, the low-temperature expansion, is developed for matrix models of random surfaces. It can be applied to models with arbitrary target spaces, including ones with c>1. As a simple illustration, the series is worked…
We analyze a probabilistic algorithm for matching shapes modeled by planar regions under translations and rigid motions (rotation and translation). Given shapes $A$ and $B$, the algorithm computes a transformation $t$ such that with high…
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.…
The scattering of free particles constrained to move on a cylindrically symmetric curved surface is studied. The nontrivial geometry of the space contributes to the scattering cross section through the kinetic as well as a possible scalar…
We study the problem of minimizing the average of a very large number of smooth functions, which is of key importance in training supervised learning models. One of the most celebrated methods in this context is the SAGA algorithm. Despite…
In 2017, Lienert and Tumulka proved Born's rule on arbitrary Cauchy surfaces in Minkowski space-time assuming Born's rule and a corresponding collapse rule on horizontal surfaces relative to a fixed Lorentz frame, as well as a given unitary…
In this paper, we present a new approach of creating PTAS to the TSP problems by defining a bounded-curvature surface embedded spaces. Using this definition we prove: - A bounded-curvature surface embedded spaces TSP admits to a PTAS. -…
Acceleration of algorithms is becoming a crucial problem, if larger data sets are to be processed. Evaluation of algorithms is mostly done by using computational geometry approach and evaluation of computational complexity. However in…
We prove that Riemannian contraction in a supervised learning setting implies generalization. Specifically, we show that if an optimizer is contracting in some Riemannian metric with rate $\lambda > 0$, it is uniformly algorithmically…
Let $p$ be a positive number. Consider probability measure $\gamma_p$ with density $\varphi_p(y)=c_{n,p}e^{-\frac{|y|^p}{p}}$. We show that the maximal surface area of a convex body in $\mathbb{R}^n$ with respect to $\gamma_p$ is…
We consider approximation of diameter of a set $S$ of $n$ points in dimension $m$. E$\tilde{g}$ecio$\tilde{g}$lu and Kalantari \cite{kal} have shown that given any $p \in S$, by computing its farthest in $S$, say $q$, and in turn the…
Consider a 2-plane $P \subset \mathbb{C}^n$ and let $D$ be a bounded region in $P$ with a piecewise-smooth boundary. Let $I(D)$ be the infimum of areas of all piecewise-smooth isotropic surfaces in $\mathbb{C}^n$ with the same boundary as…
While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…
Algorithm evaluation and comparison are fundamental questions in machine learning and statistics -- how well does an algorithm perform at a given modeling task, and which algorithm performs best? Many methods have been developed to assess…