Related papers: The area of rhumb polygons
In this article, we aim at obtaining the analytical expressions ({\bf not previously found and not recorded in the literature}) for the exact curved surface area of a hemiellpsoid in terms of Appell's double hypergeometric function of first…
A method is described by which a function defined on a cubic grid (as from a finite difference solution of a partial differential equation) can be resolved into spherical harmonic components at some fixed radius. This has applications to…
In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…
The perimeter and area generating functions of exactly solvable polygon models satisfy q-functional equations, where q is the area variable. The behaviour in the vicinity of the point where the perimeter generating function diverges can…
The deviation of a general convex body with twice differentiable boundary and an arbitrarily positioned polytope with a given number of vertices is studied. The paper considers the case where the deviation is measured in terms of the…
We say that a polygon inscribed in the circle is asymmetric if it contains no two antipodal points being the endpoints of a diameter. Given $n$ diameters of a circle and a positive integer $k<n$, this paper addresses the problem of…
Starting from the well-known and elementary problem of inscribing the rectangle of the greatest area in an ellipse, we look at possible, gradually more and more complicated variants of this problem. Our goal is to demonstrate to an average…
Given a trapezoid dissected into triangles, the area of any triangle determined by either diagonal of the trapezoid is integral over the ring generated by the areas of the triangles in the dissection. Given a parallelogram dissected into…
A multi-cube method is developed for solving systems of elliptic and hyperbolic partial differential equations numerically on manifolds with arbitrary spatial topologies. It is shown that any three-dimensional manifold can be represented as…
An example of the volume and boundary face area of a curved polyhedron for the case of regular spherical and hyperbolic tetrahedron is discussed. An exact formula is explicitly derived as a function of the scalar curvature and the edge…
We describe an algorithm which computes components of Humbert surfaces in terms of Rosenhain invariants, based on Runge's method
A new algorithm for computing a point on a polynomial or rational curve in B\'{e}zier form is proposed. The method has a geometric interpretation and uses only convex combinations of control points. The new algorithm's computational…
Let $M$ be a compact Riemannian manifold not containing any totally geodesic surface. Our main result shows that then the area of any complete surface immersed into $M$ is bounded by a multiple of its extrinsic curvature energy, i.e. by a…
We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…
Pick's astonishing theorem explains how to obtain the area of any integer polygon by counting lattice points. It is a notoriously difficult challenge to translate the geometric statement and intuitive reasoning into a formal statement and…
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.
The problem deals with an exact calculation of the intersection area of a circle arbitrary placed on a grid of square shaped elements with gaps between them (finite fill factor). Usually an approximation is used for the calculation of the…
We consider the configuration space of planar $n$-gons with fixed perimeter, which is diffeomorphic to the complex projective space $\mathbb{C}P^{n-2}$. The oriented area function has the minimal number of critical points on the…
In this paper we provide, first, a general symbolic algorithm for computing the symmetries of a given rational surface, based on the classical differential invariants of surfaces, i.e. Gauss curvature and mean curvature. In practice, the…
We introduce an arbitrary order, computationally efficient method to smooth corners on curves in the plane, as well as edges and vertices on surfaces in $\mathbb R^3$. The method is local, only modifying the original surface in a…