Related papers: Analytical Formulae for Projected Solid Angle on A…
We propose a method for computing upper bounds for the Heilbronn problem for triangles.
A concise derivation of the "Joel equations", which allow for the determination of the axis angle 2V from measurements of extinction directions on a spindle stage, is provided starting from the wave-equation. Only analytic methods and no…
Surfaces of constant negative curvature in Euclidean space can be described by either the sine-Gordon equation for the angle between asymptotic directions, or a Monge-Ampere equation for the graph of the surface. We present the explicit…
In this paper we use an elementary approach by using numerical semigroups (specifically, those with two generators) to give a formula for the number of integral points inside a right-angled triangle with rational vertices. This is the basic…
This paper derives the exact cumulative density function of the distance between a randomly located node and any arbitrary reference point inside a regular $\el$-sided polygon. Using this result, we obtain the closed-form probability…
We present a simple, accurate method for computing singular or nearly singular integrals on a smooth, closed surface, such as layer potentials for harmonic functions evaluated at points on or near the surface. The integral is computed with…
Projection of many-body states with good angular momentum from an initial state is usually accomplished by a three-dimensional integral. We show how projection can instead be done by solving a straightforward system of linear equations. We…
The purpose of this article is twofold. First, we extend the results presented in [Gabriel Crisnejo and Emanuel Gallo, Phys.Rev.D 97, 124016 (2018)] to stationary spacetimes. Specifically, we show that the Gauss-Bonnet theorem can be…
A tutorial introduction to projective geometric algebra (PGA), a modern, coordinate-free framework for doing euclidean geometry. PGA features: uniform representation of points, lines, and planes; robust, parallel-safe join and meet…
We aim at deriving an equation of motion for specific sums of momentum mode occupation numbers from models for electrons in periodic lattices experiencing elastic scattering, electron-phonon scattering or electron-electron scattering. These…
We discuss notions of Gauss curvature and mean curvature for polyhedral surfaces. The discretizations are guided by the principle of preserving integral relations for curvatures, like the Gauss/Bonnet theorem and the mean-curvature force…
Under conditions that prevent tangential intersection, we prove quadratic convergence of a projection algorithm for the feasibility problem of finding a point in the intersection of a smooth curve and line in $\mathbb{R}^2$. This nonconvex…
An analytic center cutting plane method is an iterative algorithm based on the computation of analytic centers. In this paper, we propose some analytic center cutting plane methods for solving quasimonotone or pseudomonotone variational…
This paper proposes a fast and accurate surface normal estimation method which can be directly used on depth maps (organized point clouds). The surface normal estimation process is formulated as a closed-form expression. In order to reduce…
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…
We are presenting a simple and numerical stable algorithm for the solution of the cone projection problem which is suitable for relative small data sets and for simulation purposes needed for convexity tests. Not even one pseudo-inverse…
We consider a generalized angle in complex normed vector spaces. Its definition corresponds to the definition of the well known Euclidean angle in real inner product spaces. Not surprisingly it yields complex values as `angles'. This…
The Simpson's formula is obtained by approximating the integral of a function on some interval by the integral of the quadratic polynomial determined by the function. However, a multidimensional analogue of the formula has not been given as…
In this paper we present several formulae for computing the partial degrees of the defining polynomial of the offset curve to an irreducible affine plane curve given implicitly, and we see how these formulae particularize to the case of…
We present a simple and efficient acceleration technique for an arbitrary method for computing the Euclidean projection of a point onto a convex polytope, defined as the convex hull of a finite number of points, in the case when the number…