Related papers: The Area Method in the Wolfram Language
An area-preserving parameterization is a bijective mapping that maps a surface onto a specified domain and preserves the local area. This paper formulates the computation of disk area-preserving parameterization as an authalic energy…
Two averaging algorithms are considered which are intended for choosing an optimal plane and an optimal circle approximating a group of points in three-dimensional Euclidean space.
Integrals related to the surface area of arbitrary ellipsoids are derived, evaluated, and compared with each other and existing integrals found in the literature. We clarify the literature on the ellipsoid area problem, which dates back to…
Feature matching is a crucial technique in computer vision. A unified perspective for this task is to treat it as a searching problem, aiming at an efficient search strategy to narrow the search space to point matches between images. One of…
We further research on the accelerated optimization phenomenon on Riemannian manifolds by introducing accelerated global first-order methods for the optimization of $L$-smooth and geodesically convex (g-convex) or $\mu$-strongly g-convex…
We investigate different aspects of area convexity [Sherman '17], a mysterious tool introduced to tackle optimization problems under the challenging $\ell_\infty$ geometry. We develop a deeper understanding of its relationship with more…
The complexity of Philip Wolfe's method for the minimum Euclidean-norm point problem over a convex polytope has remained unknown since he proposed the method in 1974. The method is important because it is used as a subroutine for one of the…
Projective geometry provides the preferred framework for most implementations of Euclidean space in graphics applications. Translations and rotations are both linear transformations in projective geometry, which helps when it comes to…
We review and possibly add some new variant to the existing derivations of the formula for the area of Jordan lattice polygons drawn on two-dimensional lattices. The formula is known as Pick's theorem and is related to the number theory…
The strategy of regions [1] turns out to be a universal method for expanding Feynman integrals in various limits of momenta and masses. This strategy is reviewed and illustrated through numerous examples. In the case of typically Euclidean…
Time-domain Boundary Element Methods (BEM) have been successfully used in acoustics, optics and elastodynamics to solve transient problems numerically. However, the storage requirements are immense, since the fully populated system matrices…
In this paper we investigate the evolution of the concept of area in Peano's works, taking into account the main role played by Grassmann's geometric-vector calculus and Peano's theory on derivative of measures. Geometric (1887) and…
Bayesian error analysis paves the way to the construction of credible and plausible error regions for a point estimator obtained from a given dataset. We introduce the concept of region accuracy for error regions (a generalization of the…
Variational analysis presents a unified theory encompassing in particular both smoothness and convexity. In a Euclidean space, convex sets and smooth manifolds both have straightforward local geometry. However, in the most basic hybrid case…
We analyse the axioms of Euclidean geometry according to standard object-oriented software development methodology. We find a perfect match: the main undefined concepts of the axioms translate to object classes. The result is a suite of C++…
This paper develops a class of Bayesian non- and semiparametric methods for estimating regression curves and surfaces. The main idea is to model the regression as locally linear, and then place suitable local priors on the local parameters.…
We introduce a new algorithm to solve a regularized spatial-spectral image estimation problem. Our approach is based on the linearized alternating directions method of multipliers (LADMM), which is a variation of the popular ADMM algorithm.…
I am going to provide a new technique of approximating area under the curve, using the Newton-Raphson Method. I am also going to provide a formula that would help us approximate any Definite Integral or help us find the area under the…
Sphere fitting is a common problem in almost all science and engineering disciplines. Most of methods available are iterative in behavior. This involves fitting of the parameters in a least square sense or in a geometric sense. Here we…
In this paper, the generalized finite element method (GFEM) for solving second order elliptic equations with rough coefficients is studied. New optimal local approximation spaces for GFEMs based on local eigenvalue problems involving a…