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 crunode, also known as an ordinary double point, of a plane curve is point where a curve intersects itself so that two branches of the curve have distinct tangent lines. ...

A geometry in which Euclid's fifth postulate holds, sometimes also called parabolic geometry. Two-dimensional Euclidean geometry is called plane geometry, and ...

The closed plane curve that crosses itself once and consists of one lobe on each side of the intersection. It can be viewed as a circle with a half twist. The fundamental ...

A collection of faces of an n-dimensional polytope or simplicial complex, one of each dimension 0, 1, ..., n-1, which all have a common nonempty intersection. In normal three ...

Functional analysis is a branch of mathematics concerned with infinite-dimensional vector spaces (mainly function spaces) and mappings between them. The spaces may be of ...

Let F_0 and F_1 denote two directly similar figures in the plane, where P_1 in F_1 corresponds to P_0 in F_0 under the given similarity. Let r in (0,1), and define ...

Define the zeta function of a variety over a number field by taking the product over all prime ideals of the zeta functions of this variety reduced modulo the primes. Hasse ...

Any partition of the plane into regions of equal area has perimeter at least that of the regular hexagonal grid (i.e., the honeycomb, illustrated above). Pappus refers to the ...

e^(izcostheta)=sum_(n=-infty)^inftyi^nJ_n(z)e^(intheta), where J_n(z) is a Bessel function of the first kind. The identity can also be written ...