Related papers: With what probability does an inscribed triangle c…
The hypothesis that high dimensional data tend to lie in the vicinity of a low dimensional manifold is the basis of manifold learning. The goal of this paper is to develop an algorithm (with accompanying complexity guarantees) for fitting a…
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…
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.…
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.
We have developed a general Bayesian algorithm for determining the coordinates of points in a three-dimensional space. The algorithm takes as input a set of probabilistic constraints on the coordinates of the points, and an a priori…
In this paper, we have considered a uniform probability distribution supported by a stretched Sierpi\'nski triangle. For this probability measure, the optimal sets of $n$-means and the $n$th quantization errors are determined for all $n\geq…
The results of the study provide guidelines for the development and applications of algorithms. When the number of steps for calculating an assumption tends to infinity, probability theory can be applied to predict whether the assumption…
In this paper we address the complexity of solving linear programming problems with a set of differential equations that converge to a fixed point that represents the optimal solution. Assuming a probabilistic model, where the inputs are…
Let T be a random triangle in a disk D of radius R (meaning that vertices are independent and uniform in D). We determine the bivariate density for two arbitrary sides a,b of T. In particular, we compute that E(a*b)=(0.837...)*R^2, which…
Given independent normally distributed points A,B,C,D in Euclidean 3-space, let Q denote the plane determined by A,B,C and D^ denote the orthogonal projection of D onto Q. The probability that the tetrahedron ABCD is acute remains…
If we label the vertices of a triangle with 1, 2 and 4, and the orthocentre with 7, then any of the four numbers 1, 2, 4, 7 is the nim-sum of the other three and is their orthocentre. Regard the triangle as an orthocentric quadrangle.…
In his seminal paper on triangle centers, Clark Kimberling made a number of conjectures concerning the distances between triangle centers. For example, if $D(i; j)$ denotes the distance between triangle centers $X_i$ and $X_j$ , Kimberling…
In this paper we introduce the intuitive notion of trivergence of probability distributions (TPD). This notion allow us to calculate the similarity among triplets of objects. For this computation, we can use the well known measures of…
This letter gives approximations to an integral appearing in the formula for downlink coverage probability of a typical user in Poisson point process (PPP) based stochastic geometry frameworks of the form $\int_0^\infty \exp\{ - (Ax + B…
Let T be a triangulation of a simple polygon. A flip in T is the operation of removing one diagonal of T and adding a different one such that the resulting graph is again a triangulation. The flip distance between two triangulations is the…
To generate a triangle of unit perimeter, break a stick of length 1 in two places at random, with the condition that triangle inequalities are satisfied. Is there a similarly natural method for generating triangles of unit area? Study of a…
Yet more candidates are proposed for inclusion in the Encyclopedia of Triangle Centers. Our focus is entirely on simple calculations.
The distance between the true and numerical solutions in some metric is considered as the discretization error magnitude. If error magnitude ranging is known, the triangle inequality enables the estimation of the vicinity of the approximate…
Let $P$ be a set of $N$ points in the Euclidean plane, where a positive proportion of points lies off a single straight line. This note points out two facts concerning the number of equivalence classes of triangles that $P$ determines,…
We study the set of image tuples arising from fixed cameras observing varying planar 3-dimensional point configurations. We derive a formula for the number of complex critical points of the triangulation problem, which seeks to reconstruct…