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 ...

Concentric circles are circles with a common center. The region between two concentric circles of different radii is called an annulus. Any two circles can be made concentric ...

The most common form of cosine integral is Ci(x) = -int_x^infty(costdt)/t (1) = gamma+lnx+int_0^x(cost-1)/tdt (2) = 1/2[Ei(ix)+Ei(-ix)] (3) = -1/2[E_1(ix)+E_1(-ix)], (4) ...

Deck transformations, also called covering transformations, are defined for any cover p:A->X. They act on A by homeomorphisms which preserve the projection p. Deck ...

Let Delta denote an integral convex polytope of dimension n in a lattice M, and let l_Delta(k) denote the number of lattice points in Delta dilated by a factor of the integer ...

The geodesic on an oblate spheroid can be computed analytically, although the resulting expression is much more unwieldy than for a simple sphere. A spheroid with equatorial ...

A quartic vertex-transitive graph is a quartic graph that is vertex transitive. Read and Wilson (1988, pp. 164-166) enumerate all connected quartic vertex-transitive graphs ...

A simplex, sometimes called a hypertetrahedron (Buekenhout and Parker 1998), is the generalization of a tetrahedral region of space to n dimensions. The boundary of a ...

A two-dimensional map also called the Taylor-Greene-Chirikov map in some of the older literature and defined by I_(n+1) = I_n+Ksintheta_n (1) theta_(n+1) = theta_n+I_(n+1) ...

The Zara graph is the unique graph on 126 vertices satisfying the properties that 1) every maximal clique (of which there are a total of 567) has six vertices, and 2) that if ...