Related papers: Random triangle problem: geometrical approach
We give a general method for rounding linear programs that combines the commonly used iterated rounding and randomized rounding techniques. In particular, we show that whenever iterated rounding can be applied to a problem with some slack,…
It has been known that the distribution of the random distances between two uniformly distributed points within a convex polygon can be obtained based on its chord length distribution (CLD). In this report, we first verify the existing…
We discuss different approaches for the enumeration of triangulated surfaces. In particular, we enumerate all triangulated surfaces with 9 and 10 vertices. We also show how geometric realizations of orientable surfaces with few vertices can…
This is a paper about triangle cubics and conics in classical geometry with elements of projective geometry. In recent years, N.J. Wildberger has actively dealt with this topic using an algebraic perspective. Triangle conics were also…
We consider the problem of optimizing the product of the distances from a given point in a triangle to each vertex. There are two possible cases in general. For isosceles triangles, we explicitly show exactly when both cases occur.
It has long been a puzzle how to solve random multiplicative cascade structures analytically. We present an analytical solution found recently in the form of a simple pedagogical example of the general case.
We consider the problem of finding integer-sided triangles with R/r an integer, where R and r are the radii of the circumcircle and incircle respectively. We show that such triangles are relatively rare.
The equality constraint a+b+c=1 for random triangle sides corresponds to breaking a stick in two places. An analog a^2+b^2+c^2=1 has a remarkable feature: the bivariate density for angles coincides with that for 3D Gaussian triangles.…
Percolation on a plane is usually associated with clusters spanning two opposite sides of a rectangular system. Here we investigate three-leg clusters generated on a square lattice and spanning the three sides of equilateral triangles. If…
The three-dimensional cylindrical regression problem is a problem of finding a cylinder best fitting a group of points in three-dimensional Euclidean space. The words best fitting are usually understood in the sense of the minimum root mean…
An algorithmic method to exploit a general class of infinitesimal symmetries for reducing stochastic differential equations is presented and a natural definition of reconstruction, inspired by the classical reconstruction by quadratures, is…
The Bertrand's theorem can be formulated as the solution of an inverse problem for a classical unidimensional motion. We show that the solutions of these problems, if restricted to a given class, can be obtained by solving a numerical…
A geometric inequality among three triangles, originating in circle packing problems, is introduced. In order to prove it, we reduce the original formulation to the nonnegativity of a particular polynomial in four real indeterminates.…
A random jigsaw puzzle is constructed by arranging $n^2$ square pieces into an $n \times n$ grid and assigning to each edge of a piece one of $q$ available colours uniformly at random, with the restriction that touching edges receive the…
We present two new quantum algorithms that either find a triangle (a copy of $K_{3}$) in an undirected graph $G$ on $n$ nodes, or reject if $G$ is triangle free. The first algorithm uses combinatorial ideas with Grover Search and makes…
There is well-known problem of geometric probability which can be quote as the Broken Spaghetti Problem. It addresses the following question: A stick of spaghetti breaks into three parts and all points of the stick have the same probability…
The conditions determining that two triangles are congruent play a basic role in planimetry. By comparing not congruent triangles with respect to given sets of corresponding elements it is important to discover if they have any common…
We describe a simple geometric transformation of triangles which leads to an efficient and effective algorithm to smooth triangle and tetrahedral meshes. Our focus lies on the convergence properties of this algorithm: we prove the…
A triangle with rational sides and rational area is called a rational triangle. In this paper we consider three problems of finding pairs of rational triangles which have a common circumradius as well as either a common perimeter or a…
We develop a novel randomized conjugate gradient least squares (RCGLS) method for solving least-squares problems, in which iterative sketching is employed at each step to reduce the dimension and hence the computational cost. In particular,…