Search Results for ""

The study of efficient algorithms for solving geometric problems. Examples of problems treated by computational geometry include determination of the convex hull and Voronoi ...

A special case of Apollonius' problem requiring the determination of a circle touching three mutually tangent circles (also called the kissing circles problem). There are two ...

The squared norm of a four-vector a=(a_0,a_1,a_2,a_3)=a_0+a is given by the dot product a^2=a_mua^mu=(a^0)^2-a·a, (1) where a·a is the usual vector dot product in Euclidean ...

The Games graph is a strongly regular graph on 729 vertices with parameters (nu,k,lambda,mu)=(729,112,1,20). It is distance-regular but not distance-transitive with ...

The polynomials G_n(x;a,b) given by the associated Sheffer sequence with f(t)=e^(at)(e^(bt)-1), (1) where b!=0. The inverse function (and therefore generating function) ...

A the (first, or internal) Kenmotu point, also called the congruent squares point, is the triangle center constructed by inscribing three equal squares such that each square ...

Let x:U->R^3 be a regular patch, where U is an open subset of R^2. Then (partiale)/(partialv)-(partialf)/(partialu) = eGamma_(12)^1+f(Gamma_(12)^2-Gamma_(11)^1)-gGamma_(11)^2 ...

Synergetics coordinates are a set of triangular coordinates in their plane (or their generalization to tetrahedral coordinates in space, or the analogs in higher dimensions). ...

The cuboctahedron, also called the heptaparallelohedron or dymaxion (the latter according to Buckminster Fuller; Rawles 1997), is the Archimedean solid with faces 8{3}+6{4}. ...

Place two solid spheres of radius 1/2 inside a hollow sphere of radius 1 so that the two smaller spheres touch each other at the center of the large sphere and are tangent to ...