Search Results for ""
371 - 380 of 392 for Petrie_polygonSearch Results
A Moore graph of type (v,g) is a regular graph of vertex degree v>2 and girth g that contains the maximum possible number of nodes, namely ...
The intersection H of the three altitudes AH_A, BH_B, and CH_C of a triangle is called the orthocenter. The name was invented by Besant and Ferrers in 1865 while walking on a ...
A general prism is a polyhedron possessing two congruent polygonal faces and with all remaining faces parallelograms (Kern and Bland 1948, p. 28; left figure). A right prism ...
If A moves along a known curve, then P describes a pursuit curve if P is always directed toward A and A and P move with uniform velocities. Pursuit curves were considered in ...
The word "rigid" has two different meaning when applied to a graph. Firstly, a rigid graph may refer to a graph having a graph automorphism group containing a single element. ...
A roulette is a curve traced by a fixed point on a closed convex curve as that curve rolls without slipping along a second curve. The roulettes described by the foci of ...
Let a spherical triangle be drawn on the surface of a sphere of radius R, centered at a point O=(0,0,0), with vertices A, B, and C. The vectors from the center of the sphere ...
A plane-filling arrangement of plane figures or its generalization to higher dimensions. Formally, a tiling is a collection of disjoint open sets, the closures of which cover ...
The study of angles and of the angular relationships of planar and three-dimensional figures is known as trigonometry. The trigonometric functions (also called the circular ...
An unfolding is the cutting along edges and flattening out of a polyhedron to form a net. Determining how to unfold a polyhedron into a net is tricky. For example, cuts ...
...
View search results from all Wolfram sites (3422 matches)

