# Search Results for ""

1 - 10 of 237 for Voronoi diagramSearch Results

The partitioning of a plane with n points into convex polygons such that each polygon contains exactly one generating point and every point in a given polygon is closer to ...

The generalization of a

**Voronoi**polygon to n dimensions for n>2.A schematic mathematical illustration showing the relationships between or properties of mathematical objects.

A polygon whose interior consists of all points in the plane which are closer to a particular lattice point than to any other. The generalization to n dimensions is called a ...

The boundaries of the cells of a

**Voronoi****diagram**.A knot

**diagram**in which none of the crossings are reducible.A web

**diagram**, also called a cobweb plot, is a graph that can be used to visualize successive iterations of a function y=f(x). In particular, the segments of the**diagram**...A

**diagram**used in the solution of ordinary differential equations of the form (dw)/(dz)=(g(z,w))/(h(z,q)) which vanish when z=0, where g(0,0)=h(0,0)=0 (Ince 1956, pp. 298 and ...A planar

**diagram**depicting a link (or knot) as a sequence of segments with gaps representing undercrossings and solid lines overcrossings. In such a**diagram**, only two ...A knot

**diagram**is a picture of a projection of a knot onto a plane. Usually, only double points are allowed (no more than two points are allowed to be superposed), and the ......