Search Results for ""

A polyhedron is said to be canonical if all its polyhedron edges touch a sphere and the center of gravity of their contact points is the center of that sphere. In other ...

The Cartesian product of two sets A and B (also called the product set, set direct product, or cross product) is defined to be the set of all points (a,b) where a in A and b ...

All closed surfaces, despite their seemingly diverse forms, are topologically equivalent to spheres with some number of handles or cross-caps. The traditional proof follows ...

The contact angle between a sphere and a tangent plane is the angle alpha between the normal to the sphere at the point of tangency and the basal plane with respect to which ...

Let P=p:q:r and U=u:v:w be distinct points, neither lying on a side line of the reference triangle DeltaABC. Then the P-cross conjugate of U is the point ...

For vectors u=(u_x,u_y,u_z) and v=(v_x,v_y,v_z) in R^3, the cross product in is defined by uxv = x^^(u_yv_z-u_zv_y)-y^^(u_xv_z-u_zv_x)+z^^(u_xv_y-u_yv_x) (1) = ...

If P=p:q:r and U=u:v:w are distinct trilinear points, neither lying on a sideline of the reference triangle DeltaABC, then the crosspoint of P and U is the point ...

A maximally nonhamiltonian graph is a nonhamiltonian graph G for which G+e is Hamiltonian for each edge e in the graph complement of G^_, i.e., every two nonadjacent vertices ...

The volume of a polyhedron composed of N triangular faces with vertices (a_i,b_i,c_i) can be computed using the curl theorem as V=1/6sum_(i=1)^Na_i·n_i, where the normal n_i ...

A quadratic recurrence is a recurrence equation on a sequence of numbers {x_n} expressing x_n as a second-degree polynomial in x_k with k<n. For example, x_n=x_(n-1)x_(n-2) ...