Related papers: Testing surface area with arbitrary accuracy
We prove a splitting theorem for Riemannian n-manifolds with scalar curvature bounded below by a negative constant and containing certain area-minimising hypersurfaces (Theorem 3). Thus we generalise [25,Theorem 3] by Nunes. This splitting…
Given a set $P$ of $n$ points in the plane, we study the computation of the probability distribution function of both the area and perimeter of the convex hull of a random subset $S$ of $P$. The random subset $S$ is formed by drawing each…
Let $\mathbb{P}_{\kappa}(n)$ be the probability that $n$ points $z_1,\ldots,z_n$ picked uniformly and independently in $\mathfrak{C}_\kappa$, a regular $\kappa$-gon with area $1$, are in convex position, that is, form the vertex set of a…
We begin by studying the surface area of an ellipsoid in n-dimensional Euclidean space as the function of the lengths of the semi-axes. We write down an explicit formula as an integral over the unit sphere in n-dimensions and use this…
Given a unirational parameterization of a surface, we present a general algorithm to determine a birational parameterization without using parameterization algorithms. Additionally, if the surface is assumed to have a birational…
We consider methods for finding a simple polygon of minimum (Min-Area) or maximum (Max-Area) possible area for a given set of points in the plane. Both problems are known to be NP-hard; at the center of the recent CG Challenge, practical…
We study the problem of estimating the average of a Lipschitz continuous function $f$ defined over a metric space, by querying $f$ at only a single point. More specifically, we explore the role of randomness in drawing this sample. Our goal…
When measuring the value of a function to be minimized is not only expensive but also with noise, the popular simultaneous perturbation stochastic approximation (SPSA) algorithm requires only two function values in each iteration. In this…
Reliable inference for spatial regression remains challenging because it requires the correct specification of the spatial dependence structure, the mean trend, and the error distribution. Existing parametric testing methods rely on…
We use the arithmetic of the Kummer surface associated to the Jacobian of a hyperelliptic curve to study the primality of integers of the form $4m^2 5^n-1$. We provide an algorithm capable of proving the primality or compositeness of most…
We study randomized algorithms for constrained optimization, in abstract frameworks that include, in strictly increasing generality: convex programming; LP-type problems; violator spaces; and a setting we introduce, consistent spaces. Such…
The spherical average $A_{1}(f)$ and its iteration $(A_{1})^{N}$ are important operators in harmonic analysis and probability theory. Also $\Delta (A_{1})^{N}$ is used to study the $K$ functional in approximation theory, where $\Delta $ is…
Envelope tests are a popular tool in spatial statistics, where they are used in goodness-of-fit testing. These tests graphically compare an empirical function $T(r)$ with its simulated counterparts from the null model. However, the type I…
We propose a simple method for uniform sampling of points on the surface of a hypersphere in arbitrarily many dimensions. By avoiding the evaluation of computationally expensive functions like logarithms, sines, cosines, or higher order…
In 3-d the average projected area of a convex solid is 1/4 the surface area, as Cauchy showed in the 19th century. In general, the ratio in n dimensions may be obtained from Cauchy's surface area formula, which is in turn a special case of…
We propose an algorithm to construct a certified approximation of a surface by generalizing the Krawczyk test. The Krawczyk test is based on interval arithmetic, and confirms the existence and uniqueness of a solution to a square system of…
In the calculation of thermodynamic properties and three dimensional structures of macromolecules, such as proteins, it is important to have a good algorithm for computing solvent accessible surface area of macromolecules. Here we propose a…
The goal of random sequential adsorption (RSA), a time-dependent packing method, is to create a regular or asymmetric covering of an empty space that can fit in the allocated space without overlapping. The density of coverage tends to reach…
We revisit the problem of robust linear regression under Gaussian covariates with an unknown covariance matrix of condition number $\kappa$. For this fundamental problem, significant gaps remain in our understanding of the trade-offs among…
We present a cost-efficient and versatile method to map an unknown 3D freeform surface using only sparse measurements while the end-effector of a robotic manipulator moves along the surface. The geometry is locally approximated by a plane,…