Search Results for ""

An algorithm for finding roots which retains that prior estimate for which the function value has opposite sign from the function value at the current best estimate of the ...

A Meyniel graph, also called a very strongly perfect graph, is a graph in which every odd cycle of length five or more has at least two chords. Meyniel graphs are perfect. ...

The sequence produced by starting with a_1=1 and applying the greedy algorithm in the following way: for each k>=2, let a_k be the least integer exceeding a_(k-1) for which ...

The mid-arc triangle is the triangle DeltaA^'B^'C^' whose vertices consist of the intersections of the internal angle bisectors with the incircle, where the points of ...

The midcircle of two given circles is the circle which would invert the circles into each other. Dixon (1991) gives constructions for the midcircle for four of the five ...

Midpoint augmentation, a term introduced here, is a variant of conventional augmentation in which each facial polygon is replaced by a triangular polygon joining vertices ...

The radius rho of the midsphere of a polyhedron, also called the interradius. Let P be a point on the original polyhedron and P^' the corresponding point P on the dual. Then ...

Is it possible to cover completely the surface of a sphere with congruent, nonoverlapping arcs of great circles? Conway and Croft (1964) proved that it can be covered with ...

A map projection given by the following transformation, x = lambda-lambda_0 (1) y = 5/4ln[tan(1/4pi+2/5phi)] (2) = 5/4sinh^(-1)[tan(4/5phi)]. (3) Here, x and y are the plane ...

Several cylindrical equidistant projections were devised by R. Miller. Miller's projections have standard parallels of phi_1=37 degrees30^' (giving minimal overall scale ...