Search Results for ""

The mapping of a grid of regularly ruled squares onto a cone with no overlap or misalignment. Cone nets are possible for vertex angles of 90 degrees, 180 degrees, and 270 ...

A cone with elliptical cross section. The parametric equations for an elliptic cone of height h, semimajor axis a, and semiminor axis b are x = a(h-u)/hcosv (1) y = ...

The n-double cone graph is the name given in the work to the graphs that geometrically correspond to a double cone obtained by connecting all vertices of two C_n cycle graphs ...

The surface of revolution obtained by cutting a conical "wedge" with vertex at the center of a sphere out of the sphere. It is therefore a cone plus a spherical cap, and is a ...

In n-dimensional Lorentzian space R^n=R^(1,n-1), the light cone C^(n-1) is defined to be the subset consisting of all vectors x=(x_0,x_1,...,x_(n-1)) (1) whose squared ...

An m-gonal n-cone graph, also called the n-point suspension of C_m or generalized wheel graph (Buckley and Harary 1988), is defined by the graph join C_m+K^__n, where C_m is ...

A subset X of R^n is star convex if there exists an x_0 in X such that the line segment from x_0 to any point in X is contained in X. A star-shaped figure is star convex but ...

Let a cone of opening parameter c and vertex at (0,0,0) intersect a sphere of radius r centered at (x_0,y_0,z_0), with the cone oriented such that its axis does not pass ...

A planar polygon is convex if it contains all the line segments connecting any pair of its points. Thus, for example, a regular pentagon is convex (left figure), while an ...

A convex polyomino (sometimes called a "convex polygon") is a polyomino whose perimeter is equal to that of its minimal bounding box (Bousquet-Mélou et al. 1999). ...