Search Results for ""

Draw antiparallels through the symmedian point K. The points where these lines intersect the sides then lie on a circle, known as the cosine circle (or sometimes the second ...

Picking two independent sets of points x and y from a unit uniform distribution and placing them at coordinates (x,y) gives points uniformly distributed over the unit square. ...

The plane determined by the points x_1, x_2, and x_3 and the line passing through the points x_4 and x_5 intersect in a point which can be determined by solving the four ...

The definition of an Anosov map is the same as for an Anosov diffeomorphism except that instead of being a diffeomorphism, it is a map. In particular, an Anosov map is a C^1 ...

The locus of the centers of all circumconics that also pass through the orthocenter of a triangle (which, when not degenerate, are rectangular hyperbolas) is a circle through ...

An algorithm for finding the nearest local minimum of a function which presupposes that the gradient of the function can be computed. The method of steepest descent, also ...

The Steiner inellipse, also called the midpoint ellipse (Chakerian 1979), is an inellipse with inconic parameters x:y:z=a:b:c (1) giving equation ...

Newton's method, also called the Newton-Raphson method, is a root-finding algorithm that uses the first few terms of the Taylor series of a function f(x) in the vicinity of a ...

Given a triangle DeltaABC, construct the contact triangle DeltaT_AT_BT_C. Now extend lines parallel to the sides of the contact triangle from the Gergonne point. These ...

A two-dimensional affine geometry constructed over a finite field. For a field F of size n, the affine plane consists of the set of points which are ordered pairs of elements ...