Related papers: The Area Method in the Wolfram Language
The formula for the area of a rhumb polygon, a polygon whose edges are rhumb lines on an ellipsoid of revolution, is derived and a method is given for computing the area accurately. This paper also points out that standard methods for…
We give polynomial-time dynamic-programming algorithms finding the areas of words in the presentations $\langle a, b \mid a, b \rangle$ and $\langle a, b \mid a^k, b^k; \ k \in \mathbb{N} \rangle$ of the trivial group. In the first of these…
Regions-based theories of space aim -- among others -- to define points in a geometrically appealing way. The most famous definition of this kind is probably due to Whitehead. However, to conclude that the objects defined are points indeed,…
In this paper we aim to bring new approach into usage of Shoelace Algorithm for area calculation in convex polygons on Cartesian coordinate system, with concentration on point in polygon concept. Generalization of usage of the concept will…
Current practice in parameter space exploration in euclidean space is dominated by randomized sampling or design of experiment methods. The biggest issue with these methods is not keeping track of what part of parameter space has been…
We extend the Levenberg-Marquardt method on Euclidean spaces to Riemannian manifolds. Although a Riemannian Levenberg-Marquardt (RLM) method was produced by Peeters in 1993, to the best of our knowledge, there has been no analysis of…
We give a new simple proof of Dehn's theorem by generalizing the notion of area. The method proposed in the present article is actually the "translation" of the method of additive functions into the elementary math language.
We give an algorithmic proof of Pick's theorem which calculates the area of a lattice-polygon in terms of the lattice-points.
Spherical localisation is a technique whose history goes back to M.Gromov and V.Milman. It's counterpart, the Euclidean localisation is extensively studied and has been put to great use in various branches of mathematics. The purpose of…
We propose a method to construct quantum theory of matter fields in a topology changing universe. Analytic continuation of the semiclassical gravity of a Lorentzian geometry leads to a non-unitary Schr\"{o}dinger equation in a Euclidean…
In Computer Vision, edge detection is one of the favored approaches for feature and object detection in images since it provides information about their objects boundaries. Other region-based approaches use probabilistic analysis such as…
The so-called Riemann sums have their origin in the efforts of Greek mathematicians to find the center of gravity or the volume of a solid body. These researches led to the method of exhaustion, discovered by Archimedes and described using…
In decision theoretic estimation of parameters in Euclidean space $\mathbb{R}^p$, the action space is chosen to be the convex closure of the estimand space. In this paper, the concept has been extended to the estimation of circular…
The method of application of areas as presented in Euclid's Elements, is employed to generate the three conics as the loci of points with Cartesian coordinates satisfying quadratic equations with coefficients defined by the initial settings…
A rectangular layout $\mathcal{L}$ is a rectangle partitioned into disjoint smaller rectangles so that no four smaller rectangles meet at the same point. Rectangular layouts were originally used as floorplans in VLSI design to represent…
Local Fourier analysis is a strong and well-established tool for analyzing the convergence of numerical methods for partial differential equations. The key idea of local Fourier analysis is to represent the occurring functions in terms of a…
The Lov\'{a}sz Local Lemma is a very powerful tool in probabilistic combinatorics, that is often used to prove existence of combinatorial objects satisfying certain constraints. Moser and Tardos have shown that the LLL gives more than just…
The aim of this article is to show, how computer algebra can be used when applying Liu's procedure. Although Mathematica (a commercial product by Wolfram Research Inc.) is used, it is possible to use other computer algebra systems as well.
We introduce an algorithm which can be directly used to feasible and optimum search in linear programming. Starting from an initial point the algorithm iteratively moves a point in a direction to resolve the violated constraints. At the…
In this article, I develop an elementary system of axioms for Euclidean geometry. On one hand, the system is based on the symmetry principles which express our a priori ignorant approach to space: all places are the same to us (the…